Post's Problem for Ordinal Register Machines
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Complexity of Quickly ORM-Decidable Sets
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Infinite time register machines
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Relativistic Computers and Transfinite Computation
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
A generalised dynamical system, infinite time register machines, and Π11-CA;0
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Towards a theory of infinite time blum-shub-smale machines
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |
Infinite time register machines(ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands. At limit times a register content is defined as a $\liminf$ of previous register contents, if that limit is finite; otherwise the register is resetto 0. (A previous weaker version of infinitary register machines, in [6], would halt without a result in case of such an overflow.) The theory of infinite time register machines has similarities to the infinite time Turingmachines (ITTMs) of Hamkinsand Lewis. Indeed ITRMs can decide all $\Pi^1_1$ sets, yet they are strictly weaker than ITTMs.