ChurchTuring Thesis University of Virginia教堂图图弗吉尼亚大学.ppt

下载文档 降价啦

4
0
约6.88千字
约 27页
2016-12-30 发布于上海
举报
版权申诉
保障服务

ChurchTuring Thesis University of Virginia教堂图图弗吉尼亚大学.ppt

1、本文档共27页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

* Lecture 14: Church-Turing Thesis David Evans /evans cs302: Theory of Computation University of Virginia Computer Science Lecture 14: Church-Turing Thesis Reminder: PS4 is due Tuesday Alonzo Church (1903-1995) Alan Turing (1912-1954) Menu Finish computing model for TM The Most Bogus Sentence Robustness of TM Model (Church-Turing Thesis) Turing Machine . . . Infinite tape: Γ* Tape head: read current square on tape, write into current square, move one square left or right FSM: like PDA, except: transitions also include direction (left/right) final accepting and rejecting states FSM Turing Machine Formal Description . . . FSM 7-tuple: (Q, ?, Γ, δ, q0, qaccept, qreject) Q: finite set of states ?: input alphabet (cannot include blank symbol, _) Γ: tape alphabet, includes ? and _ δ: transition function: Q ? Γ ? Q ? Γ ? {L, R} q0: start state, q0 ? Q qaccept: accepting state, qaccept ? Q qreject: rejecting state, qreject ? Q (Sipser’s notation) Turing Machine Computing Model . . . FSM q0 input _ _ _ _ blanks Initial configuration: x x x x x x x x?? TM Configuration: Γ* ? Q ? Γ* tape contents left of head tape contents head and right current FSM state TM Computing Model δ*: Γ* ? Q ? Γ* ? Γ* ? Q ? Γ* δ*(L, qaccept, R) ? (L, qaccept, R) δ*(L, qreject, R) ? (L, qreject, R) The qaccept and qreject states are final: TM Computing Model δ*: Γ* ? Q ? Γ* ? Γ* ? Q ? Γ* . . . FSM q a u, v ? Γ*, a, b ? Γ u b v δ*(ua, q, bv) = δ*(uac, qr, v) if δ(q, b) = (qr, c, R) δ*(ua, q, bv) = δ*(u, qr, acv) if δ(q, b) = (qr, c, L) Also: need a rule to cover what happens at left edge of tape TM Computing Model δ*: Γ* ? Q ? Γ* ? Γ* ? Q ? Γ* . . . FSM q a u, v ? Γ*, a, b ? Γ u b v δ*(ua, q, bv) = δ*(uac, qr, v) if δ(q, b) = (qr, c, R) δ*(ua, q, bv) = δ*(u, qr, acv) if δ(q, b) = (qr, c, L) δ*(ε, q, bv) = δ*(ε, qr, cv) if δ(q, b) = (qr, c, L) Do we need a rule for the right edge of the tape? TM Computing Model δ*: Γ* ? Q ? Γ* ? Γ* ? Q ? Γ* A string w is in the