Nondeterministic infinite time Turing machines
Logic
2023-12-27 v1
Abstract
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.
Cite
@article{arxiv.2312.15748,
title = {Nondeterministic infinite time Turing machines},
author = {Erin Carmody},
journal= {arXiv preprint arXiv:2312.15748},
year = {2023}
}