0 votes 0 votes Show that the Post Correspondence Problem is undecidable over the binary alphabet $\Sigma = \{0,1\}$. Theory of Computation michael-sipser theory-of-computation post-correspondence-problem decidability proof + – admin asked Oct 19, 2019 admin 493 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.