Repository landing page
research
Decision Problems For Turing Machines
Abstract
To appear in Information Processing Letters.International audienceWe answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines. Firstly, it is -complete to determine whether the omega-language of a given Turing machine is countably infinite, where is the class of 2-differences of -sets. Secondly, it is -complete to determine whether the omega-language of a given Turing machine is uncountable- info:eu-repo/semantics/article
- Journal articles
- analytical hierarchy
- Theory of computation
- computational complexity
- formal languages
- omega-languages
- Turing machines
- decision problems
- analytical hierarchy.
- [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
- [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
- [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]