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:
De Rijksuniversiteit Groningen en de Carl von Ossietzky Universität Oldenburg (UOL) vieren dit jaar veertig jaar samenwerking. Dit doen zij door het hernieuwen van de samenwerkingsovereenkomst tijdens de opening van het Oldenburgse academisch jaar...
The COVID-19 restrictions have been tightened once again. To many staff members and students, this feels like a step backwards. We chatted with members of the Board of the University Jouke de Vries, Cisca Wijmenga and Hans Biemans about managerial...
Biological clocks have sizeable effects on the performance of elite athletes. This conclusion was drawn by chronobiologists from the University of Groningen after studying the times achieved by swimmers in four different Olympic Games. Shifting the...