The document discusses the "polling problem" that arises when trying to process unpredictable and time-dependent input with a Turing machine. Typically a polling loop is used, where the program continuously checks for changes and takes action. However, this is inefficient. The document proposes adding a "When" construct to programming languages to directly express responses to changes in state, rather than having to continuously check for changes with polling loops. This would allow programs to more naturally handle interactive and asynchronous tasks that require waiting for events over time.