Skip to Main Content
Computational Thinking for the Modern Problem Solver
book

Computational Thinking for the Modern Problem Solver

by David Riley, Kenny A. Hunt
March 2014
Beginner to intermediate content levelBeginner to intermediate
405 pages
12h 16m
English
Chapman and Hall/CRC
Content preview from Computational Thinking for the Modern Problem Solver
Limits of Computation   ◾     311  
whether any given computer program halts when it is executed. Let’s call
the assumed algorithm HaltChecker.
ink of HaltChecker as a computer program that accepts as input
another program. (Perhaps this other program is read from a le.) e pur-
pose of HaltChecker is to determine whether the other program will halt.
Figure10.16 depicts HaltChecker as black box machine. Another pro-
gram, labeled “any program” in the gure, is input to the box aer which
the algorithm in the box lights one of two lights (“will halt” or “will not
halt”).
Now consider the following program; call it InterestingProgram:
if HaltChecker ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

From Computing to Computational Thinking

From Computing to Computational Thinking

Paul S. Wang

Publisher Resources

ISBN: 9781466587793