Nondeterministic infinite time Turing machines
Carmody, Erin · arXiv (Cornell University) · 2023
This paper analyzes infinitary nondeterministic computability theory. The main result is D $ e$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a nondeterministic infinite time Turing machine. Nondeterministic infinite time Turing machines are introduced, along with relevant definitions.