On the steps of Emil Post from normal systems to the correspondence decision problem /
In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorrespondence decision problem, nowadays known as the Post Correspondence Problem (PCP).Post proved the undecidability of the PCP by areduction from his normal systems. In the presentarticle we follow the...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2020
|
| Sorozat: | Acta cybernetica
24 No. 4 |
| Kulcsszavak: | Kibernetika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.284625 |
| Online Access: | http://acta.bibl.u-szeged.hu/71765 |
| Tartalmi kivonat: | In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorrespondence decision problem, nowadays known as the Post Correspondence Problem (PCP).Post proved the undecidability of the PCP by areduction from his normal systems. In the presentarticle we follow the steps of Post, and give another, somewhat simpler and more straightforwardproof of the undecidability of the problem by using the same source of reductions as Post did.We investigate these, very different, techniques, and point out out some peculiarities in theapproach used by Post. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 613-623 |
| ISSN: | 0324-721X |