Turing computability

Turing computability的基本解释

-

图灵机可计算性

与Turing computability相关的网络例句 [注：此内容来源于网络，仅供参考]

Turing machine, random access machine, primitive recursive, cellular automaton, finite state machine, cell probe model, pointer machine, alternation, alternating Turing machine, nondeterministic Turing machine, oracle Turing machine, probabilistic Turing machine, universal Turing machine, quantum computation, parallel models: multiprocessor model, work-depth model, parallel random-access machine, shared memory.

图灵机，随机存取机，原始递归，元胞自动机，有限状态机，细胞探针模型，指针机，交替轮流进行，图灵机，非确定性图灵机，甲骨文图灵机，概率图灵机，通用图灵机，量子计算，并行型号：多模式，工作深入模型，并行随机存取机，共享内存。

Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted "Turing" version of the Church Turing thesis, namely that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.

图灵机被公认为现代计算机的原型，这台机器可以读入一系列的零和一，这些数字代表了解决某一问题所需要的步骤，按这个步骤走下去，就可以解决某一特定的问题。

Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted "Turing" version of the Church Turing thesis, namely that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.

他对计算机的重要贡献在于他提出的有限状态自动机也就是图灵机的概念，对于人工智能，它提出了重要的衡量标准&图灵测试&，如果有机器能够通过图灵测试，那他就是一个完全意义上的智能机，和人没有区别了。

与Turing computability相关的网络解释 [注：此内容来源于网络，仅供参考]

turing computability：图灵机可计算性

turbulent 湍聊 | turing computability 图灵机可计算性 | turing computable 图灵机可计算的