Computer Science, An Overview Brookshear © 2000 Addison Wesley
Chapter Eleven, Figures 1-7
Theory of Computation
Computer Science — An Overview
J. Glenn Brookshear
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.1
A Bare Bones program for computing X x Y
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.2
A Bare Bones implementation of the instruction “move Tax to Extra”
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.3
The components of a Turing machine
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.4
A Turing machine for incrementing a value
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.5
The successor function
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.6
Computing the Gödel number of a Bare Bones program
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.7 (A)
Proving the unsolvability of the halting program
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.7 (B)
Proving the unsolvability of the halting program
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.7 (C)
Proving the unsolvability of the halting program
Computer Science, An Overview Brookshear © 2000 Addison Wesley
Figure 11.7 (D)
Proving the unsolvability of the halting program