Cardinal-Recognizing Infinite Time Turing Machines
Logic
2013-10-22 v1 Formal Languages and Automata Theory
Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1310.5590,
title = {Cardinal-Recognizing Infinite Time Turing Machines},
author = {Miha E. Habič},
journal= {arXiv preprint arXiv:1310.5590},
year = {2013}
}
Comments
10 pages, presented at 2013 Computability in Europe conference