A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem
From MaRDI portal
Publication:4601127
DOI10.3233/FI-2017-1558zbMath1420.03102OpenAlexW2743083486MaRDI QIDQ4601127
Esa Sahla, Tero J.Harju, Vesa Halava
Publication date: 19 January 2018
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2017-1558
Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items (1)
This page was built for publication: A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem
