Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 3 - Section 3.1 - Algorithms - Exercises - Page 204: 64

Answer

However long the string of zeros a program P may generate, it can never be known whether it is going to print 1 ever in future. Thus if we write another program P which halts if and only if P prints 1 then P may or may not terminate. So, this program is unsolvable.

Work Step by Step

However long the string of zeros a program P may generate, it can never be known whether it is going to print 1 ever in future. Thus if we write another program P which halts if and only if P prints 1 then P may or may not terminate. So, this program is unsolvable.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions
GradeSaver will pay $500 for your Textbook Answer contributions