Year: 2023
Type: preprint
Abstract: This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ 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.
Source: arXiv (Cornell University)
Author: Carmody, Erin
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4390306755