CardinalRecognizing Infinite Time Turing Machines
Abstract
We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detecting cardinal stages of computation. The computational strength with respect to ITTMs is determined to be precisely that of the strong halting problem and the nature of the new characteristic ordinals (clockable, writable, etc.) is explored.
 Publication:

arXiv eprints
 Pub Date:
 October 2013
 DOI:
 10.48550/arXiv.1310.5590
 arXiv:
 arXiv:1310.5590
 Bibcode:
 2013arXiv1310.5590H
 Keywords:

 Mathematics  Logic;
 Computer Science  Formal Languages and Automata Theory;
 Computer Science  Logic in Computer Science;
 03D60
 EPrint:
 10 pages, presented at 2013 Computability in Europe conference