Ordinal Time Computations – OTC

Ordinal Time Computation (OTC) is a new frontier of the research in theoretical computer science which aims to go beyond the
limits of current computation paradigms by relaxing (in a controlled way) the constraints of finite time and finite space.

The project aims at studying promising computation models for ordinal computation and their relations to (classical) computability and logic. We also plan to study computation models viewed as dynamical systems and understand
how the geometrical and topological constraints can influence the computation capabilities.

One central topic is the study of infinite time Turing machines. These machines provide new insight on ordinals and we think that the algorithmic properties obtained will help the study of other models.

We aim to investigate computation models seen as dynamical systems in order to understand the relations between dynamics and infinite time computations.

For continuous time analog computation models, the notion of computation time is rather subtle. We would like to relate these models to infinite time Turing machines.

In addition to our scientific goals our project aims at structuring the research at a national level around ordinal computation topics.