Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
ext step.Go to 2. Now which of the following statements is true? Expound your answer. A. The construction is correct; The halting problem is only undecidable for computers with infinite memory B. The construction is wrong; Snapshots of a simulation cannot be captured by a computer program C. The construction is wrong; The simulation might run into a previously encountered snapshot but still halt. D. The construction is correct; It solves the halting problem in general for any computer E. The construction is wrong; The described construction cannot be written as a finite program in a proper computer. Note: The construction refers to the algorithm describ

ext step.Go to 2. Now which of the following statements is true? Expound your answer. A. The construction is correct; The halting problem is only undecidable for computers with infinite memory B. The construction is wrong; Snapshots of a simulation cannot be captured by a computer program C. The construction is wrong; The simulation might run into a previously encountered snapshot but still halt. D. The construction is correct; It solves the halting problem in general for any computer E. The construction is wrong; The described construction cannot be written as a finite program in a proper computer. Note: The construction refers to the algorithm describ

Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter5: Looping
Section: Chapter Questions
Problem 20RQ
See similar textbooks
icon
Related questions
Question

 1. Consider the following algorithm which when fed with another algorithm and an input, tells if the program halts:Simulate the first step of the algorithm given.If the program halts, return Yes, the algorithm halts and terminate.If it does not halt (as of yet), capture a snapshot of the simulation.Compare the snapshot with the previous snapshots. If it is the same as one of the snapshots previously taken, return No, the algorithm does not halt and terminate.Simulate the next step.Go to 2.
Now which of the following statements is true? Expound your answer.

A. The construction is correct; The halting problem is only undecidable for computers with infinite memory

B. The construction is wrong; Snapshots of a simulation cannot be captured by a computer program

C. The construction is wrong; The simulation might run into a previously encountered snapshot but still halt.

D. The construction is correct; It solves the halting problem in general for any computer

E. The construction is wrong; The described construction cannot be written as a finite program in a proper computer.

Note: The construction refers to the algorithm described, which is the one that is supposed to solve the halting problem.

 

2. Explain the attached diagram which shows that the Halting Problem is unsolvable.

If H(P, P) = "halts," then loop forever P as program Program H(P, I) Program K(P) Input Output Program P H(P, P) P as input If H(P, P) = "loops forever," then halt
Transcribed Image Text:If H(P, P) = "halts," then loop forever P as program Program H(P, I) Program K(P) Input Output Program P H(P, P) P as input If H(P, P) = "loops forever," then halt
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Bare Bones Programming Language
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
SEE MORE TEXTBOOKS