The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups
Abstract
We define the symmetric Post Correspondence Problem (PCP) and prove that it is undecidable. As an application we show that the original proof of undecidability of the freeness problem for 3-by-3 integer matrix semigroups works for the symmetric PCP, but not for the PCP in general.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.