Wednesday, January 14th 2015
Professor Jos Baeten
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.
Colloquium coordinators are Prof.dr. M. Aiello (e-mail :
Prof.dr. M. Biehl (e-mail:
Effective immediately, UG-authors are entitled to a discount when publishing open access in one of the 271 journals from publisher MDPI. Corresponding authors from the UG will receive a 10% discount on the article processing charge. The only...
This year, the University of Groningen has submitted four research projects to compete for the national Klokhuis Science Prize. The aim of this prize is to introduce a young and wide audience to academic research. The winning project will be...
Non-executive directors (hereafter: directors) have to take a critical stance towards the top managers they supervise. This has been the dominant perspective among researchers and the media after the financial crisis of 2008 and recent major...