图灵机

Boolean circuits provide a model of computation that is not equivalent with the Turing machine.

布尔电路提供了一个模型的计算是不等同的图灵机。

Most detailed,"lowest level", gives the Turing machine's "state table".

最详尽的，"最低水平"，使图灵机的"状态表"。

It was a theoretical exercise, an attempt to create a more elegant alternative to the Turing Machine

那只是一项理论探讨，只是尝试给图灵机创造一种优雅的替代。

With writing you have the extraordinary power of a Turing machine.

利用记录，你就拥有图灵机所具有的非凡的力量

Later, this model is called as the Turing machine.

后来，人们就称这个数字模型为图灵机。

As well. In addition, the author analyzes and studies therelationship between paradox and Tagskis Senantics and Theory of Turing Machine.

此外，本文还对悖论与塔尔斯基的语义学和图灵机理论的关系进行了分析和研究。

Historically, the first infinite model of computation was the Turing machine, introduced by the English mathematician A.

历史上，第一次无限的计算模型是图灵机，介绍了英国数学家图灵答：在1936年前发明的可编程计算机。

The work of the Turing machine is considered to be done if no line in the control table contains the combination of the current character and condition.

它实际上是图灵机的程序。如果在某时刻，对于当前的状态及当前读写头所指单元的字符没有可匹配的规则，则程序结束。

By inheriting from works done by others, we introduce Turing machine model, which is of most importance to the computational complexity theory, high level synthesis and logic synthesis.

本文在继承前人工作的基础上，将最基本也是最重要的图灵机模型及其依据于此的计算复杂性理论的若干重要概念与思想引入到EDA中的高层次综合和逻辑综合环节中。

The most important weakness of the Turing machine in comparison real computers is that its memory is not accessible immediately: in order to read a distant memory cell, all intermediate cells must also be read.

最重要的弱点，图灵机相比，真正的电脑，其内存是无法访问的立即：为了宣读了遥远的记忆细胞，所有的中间细胞还必须阅读。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。