<h3>Question Description</h3> <p>Basically it is all done. I just need a quick help type of thing. Here I have the instructions to my project on "Project1". I just need someone
<p><img alt="3. Show that the PCP is Turing-decidable over a unary alphabet, i.e., over the alphabet . (The algorithm is indeed a very efficient one.)" src="https://media.cheggcdn.com/media%2Fd03%2Fd0338e20-242f-4f63-8d77-2ebe39f459f0%2FphpAswwe4.png" style="height:91px;width:1024px;" aria-describedby="d3f"/></p>3. Show that