Descriptions of turing machines


Discuss the below:

Q: Let A be a turing-recognizable language consisting of descriptions of Turing machines, {, ,...}, where every Mi is a decider. Prove that some decidable language D is not decided by any decider Mi whose description appears in A. (Hint: You may find it helpful to consider an enumerator for A.)

Solution Preview :

Prepared by a verified Expert
Theory of Computation: Descriptions of turing machines
Reference No:- TGS01933858

Now Priced at $20 (50% Discount)

Recommended (96%)

Rated (4.8/5)