Well-founded Iterations of Infinite Time Turing Machines
Robert Lubarsky
TL;DR
This paper explores extended infinite time Turing machines with iterated oracle calls, analyzing their expressive power and determining their capabilities in various extensions.
Contribution
It introduces and examines new iterations of infinite time Turing machines, expanding understanding of their computational power.
Findings
Determined the expressive power of extended infinite time Turing machines.
Identified cases where the computational capabilities are enhanced.
Provided theoretical insights into the limits of these extended models.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Cellular Automata and Applications · Quantum Computing Algorithms and Architecture