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
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...