Question: Show that the Post Correspondence Problem is undecidable over the binary alphabet = {0,1}.

Show that the Post Correspondence Problem is undecidable over the binary alphabet Σ = {0,1}.

Step by Step Solution

3.44 Rating (183 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Turing recognizable languages are not closed under complement In fact Theorem 1 better explains the ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction theory computation Questions!