paper

Well-founded Iterations of Infinite Time Turing Machines

arXiv:1510.00691

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.

arXiv commentin Ways of Proof Theory (Ralf Schindler, ed.), Ontos, 2010