Jos Baeten - Computability revisited

Classical computability theory disregards runtime interaction completely. The strong Church-Turing thesis states that anything a computer can do can also be done by a Turing machine, given enough time and memory. This thesis is invalidated by e.g. a self-driving car, as all possible crossing pedestrians cannot be put on the Turing tape before starting, and resulting actions cannot be postponed until after finishing. Concurrency theory gives us a proper treatment of interaction. The talk surveys what happens when computability theory is integrated with concurrency theory, which theorems remain valid and which theorems should be adapted. The Reactive Turing Machine is introduced as a model of computability with interaction.