黄永平《计算机导论精品教学》ch17[Part5.Advanced Topics] Theory of Computation.pptVIP

下载本文档

0
0
约2.16千字
约 25页
2018-05-06 发布于浙江
举报
版权申诉

黄永平《计算机导论精品教学》ch17[Part5.Advanced Topics] Theory of Computation.ppt

1、本文档共25页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

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 Tape Figure 17-4 Transition state Table 17.1 Transitional table CurrentState----- A A B B C C D D Write---------------- # 1 same as read blank 1 same as read 1 NewState----- B C C A B D B D Read------------- 1 or blank # or 1 not 1 1 not 1 not a blank blank Move-------- ? ? ? ? ? ? ? Figure 17-5 Transition diagram for incr x Table 17.2 Transitional table for incr x statement CurrentState--------- StartIncr Forward Forward Added Backward Backward Write---------------- # 1 1 same as read # NewState---------- Forward Forward Added Backward Backward StopIncr Read------------- # 1 any not # # Move-------- ? ? ? ? ? Figure 17-6 Steps in incr x statement Figure 17-7 Transition diagram for decr x Table 17.3 Transitional table for decr x statement CurrentState--------- StartDecr Forward Forward Delete Backward Backward Write---------------- # 1 blank same as read # NewState---------- Forward Forward Delete Backward Backward StopDecr Read------------- # 1 1 not # # Move-------- ? ? ? ? ? Figure 17-8 Transition diagram for the loop statement Table 17.4 Transitional table for the loop statement CurrentState--------- StartLoop Check Check Forward Forward … … EndProcess Backward Backward Read------------- # not 1 1 not … … any not # # Move-------- ? ? ? ? none … … ? ? none NewState--------- Check StopLoop Forward Forward StartProcess … …