精·软件工程导论17.n.pptVIP

Brooks/Cole, 2003 Chapter 17 TheoryofComputation Understand how a simple language with limited statements can solve any problem. Understand how the Turing machine can solve any problem thatcan be solved by a computer. Understand the Godel number and its importance in thetheory of computation. After reading this chapter, the reader should be able to: OBJECTIVES Understand the halting problem as an example of a largeset of problems that cannot be solved by a computer. SIMPLELANGUAGE 17.1 Figure 17-1 Statements in simple language TURINGMACHINE 17.2 Figure 17-2 Turing machine Figure 17-3