图灵机(数学模拟计算机)之数学原理(加精)(Mathematical principles of Turing machine (mathematical simulation computer)).docVIP

图灵机(数学模拟计算机)之数学原理(加精)(Mathematical principles of Turing machine (mathematical simulation computer)).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
图灵机(数学模拟计算机)之数学原理(加精)(Mathematical principles of Turing machine (mathematical simulation computer)) The beginning of the tape gives the universal machine U the full information needed to accurately simulate any given machine T! To understand how this works, we first need a systematic way of numbering the Turing machines. Consider defining a particular, such as an instruction table for the Turing machine described earlier. We have to encode the table into a string of 0 and 1 according to some exact scheme. We can make use of the contraction step that has been used before. Because, if we use a number 2, 5-tetrafluorobenzoic and 6 to represent the symbol R, L, STOP, arrow (- ), and commas, then we can use 110, 1110, 11110, 1110 and 11110 the contraction of coding. In this way, the actual string of symbols appearing in the table can be encoded into 0 and 10 digits 0 and 1 respectively. Because in the Turing machine table, at the end of the binary count the number of capital position to the capital of 0 s and 1 s from other small demarcation of Arabic numerals, so we dont need to use different notation. In this way, 1101 will be read as a binary digit 1101, while the tape is encoded as 1010010. In particular, 00 is read as 00, which can be encoded unambiguously as 0, or as a symbol that is completely omitted. In fact, we cant encode any arrows or any symbols that are in front of it, and depend on the sequence of instructions to indicate what symbols must be. Although in the process of taking this step, there are additional dumb instructions necessary to ensure that there are no gaps in this order. Such practices have considerable economic efficiency. (for example, Turing XN + 1 to 1100 without telling us what to do order, this is because this instruction never occur when the machine is running, so we should insert a dumb instruction, such as 1100-00 r, it can be incorporated into the table without changing anything. Similarly, we should put 101-00 insert into XN x 2 r.)

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档