6.2 杜林机(Turing machine) 6.2.1 杜林机基本构造 杜林机(以下简称 TM)是由 Alan Turing 所提出用来描绘计算过程的数学模型。
基于149个网页-相关网页
... Turing machine 图灵机 ; 杜林机 ; 图灵计算机 ; 图录机 Turing Number 系统给出的校验码 Blan Turing 由艾伦·图灵 ...
基于52个网页-相关网页
Universal Turing machine 通用图灵机 ; 等价于一台普适图灵机
quantum turing machine 量子图灵机
Non-deterministic Turing machine 非确定型图灵机 ; 非确定性图灵机
Nondeterministic Turing machine 非确定型图灵机 ; 非确定性图灵机
Neural Turing Machine 神经图灵机
tape bounded turing machine 受带限制的图灵机 ; 带限制杜林机 ; 带限制图灵机
encoded Turing machine 编码图灵机
N a hypothetical universal computing machine able to modify its original instructions by reading, erasing, or writing a new symbol on a moving tape of fixed length that acts as its program. The concept was instrumental in the early development of computer systems 图灵机
No one wants to program a Turing machine.
没人想在图灵机上写程序。
Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.
此外,Wolfram和Matthew Cook还证明了110规则在计算上等同于一个一般性图灵机。
Often considered to be the father of modern computer science, Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine.
通常认为他是现代计算机科学之父,图灵利用图灵机的发明提供了一套影响深远的关于算法和计算概念的规范。
应用推荐