Let's compute through infinite time!
Sabrina Ouazzani2 févr. 2017 - 14:00
In this talk, we present infinite time Turing machines (ITTM), from the original definition of the model to some new infinite time algorithms.
We will present algorithmic techniques that allow to highlight some properties of the ITTM-computable ordinals. In particular, we will study gaps in ordinal computation times, that is to say, ordinal times at which no infinite time program halts.