The exact complexity of the infinite Post Correspondence Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2015

The exact complexity of the infinite Post Correspondence Problem

Résumé

In this short note, we give the exact complexity of the infinite Post Correspondence Problem, showing that it is Π^0_1-complete. Surprisingly, it turns out that the infinite Post Correspondence Problem is not " more complex " than the Post Correspondence Problem, which is known to be Σ^0_1-complete, but has the exact dual complexity. This gives an answer to a question of Simonnet [Sim10].
Fichier principal
Vignette du fichier
Coomplexity-Infinite-PCP - IPL - revised - Version-2.pdf (83.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01376975 , version 1 (06-10-2016)

Identifiants

Citer

Olivier Finkel. The exact complexity of the infinite Post Correspondence Problem. Information Processing Letters, 2015, 115 (6-8), pp.609-611. ⟨10.1016/j.ipl.2015.02.009⟩. ⟨hal-01376975⟩
64 Consultations
517 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More