1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
1 The Post Correspondence Problem continued. 2 1. We will prove that the MPC problem is undecidable 2. We will prove that the PC problem is undecidable.
