Well-founded Iterations of Infinite Time Turing Machines
Logic
2015-10-05 v1
Abstract
Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined.
Keywords
Cite
@article{arxiv.1510.00691,
title = {Well-founded Iterations of Infinite Time Turing Machines},
author = {Robert Lubarsky},
journal= {arXiv preprint arXiv:1510.00691},
year = {2015}
}
Comments
in Ways of Proof Theory (Ralf Schindler, ed.), Ontos, 2010