Decision Problems For Turing Machines - Logique Access content directly
Journal Articles Information Processing Letters Year : 2009

Decision Problems For Turing Machines

Olivier Finkel
  • Function : Author
  • PersonId : 834645
Dominique Lecomte
  • Function : Author
  • PersonId : 853526

Abstract

We 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 $D_2(\Sigma_1^1)$-complete to determine whether the omega-language of a given Turing machine is countably infinite, where $D_2(\Sigma_1^1)$ is the class of 2-differences of $\Sigma_1^1$-sets. Secondly, it is $\Sigma_1^1$-complete to determine whether the omega-language of a given Turing machine is uncountable.
Fichier principal
Vignette du fichier
Cardinalities.pdf (123.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00413331 , version 1 (03-09-2009)

Identifiers

Cite

Olivier Finkel, Dominique Lecomte. Decision Problems For Turing Machines. Information Processing Letters, 2009, 109 (23-24), pp.1223-1226. ⟨hal-00413331⟩
161 View
238 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More