2023/12/25 by Carmody, Erin
#FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.2312.15748
This paper analyzes infinitary nondeterministic computability theory. The main result is D ≠ ND ∩ 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.