4.30 Let A be a Turing-recognizable language consisting of descriptions of Turing ma- chines, ((M1), (M2), ...), where every M, is a decider. Prove that some decidable language D is not decided by any decider M, whose description appears in A. (Hint: You may find it helpful to consider an enumerator for A.)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Can you help me with this question? I'm struggling to grasp how to tackle it and come up with an answer. Could you simplify it into steps, guiding me towards the solution so I can understand the approach you used?

4.30 Let A be a Turing-recognizable language consisting of descriptions of Turing ma-
chines, ((M1), (M2), ...), where every M, is a decider. Prove that some decidable
language D is not decided by any decider M, whose description appears in A.
(Hint: You may find it helpful to consider an enumerator for A.)
Transcribed Image Text:4.30 Let A be a Turing-recognizable language consisting of descriptions of Turing ma- chines, ((M1), (M2), ...), where every M, is a decider. Prove that some decidable language D is not decided by any decider M, whose description appears in A. (Hint: You may find it helpful to consider an enumerator for A.)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education