×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [mpc problem slide]
Home >
mpc problem slide
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
219 views
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.
219 views