Non-deterministic Turing machine
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. In essence, a Turing machine is imagined to be a simple computer that reads and writes symbols one at a time on an endless tape by strictly following a set of rules. It determines what action it should perform next according to its internal state and what symbol it currently sees. An example of one of a Turing Machine's rules might thus be: "If you are in state 2 and you see an 'A', change it to 'B' and move left."
Wikipage disambiguates
primaryTopic
Non-deterministic Turing machine
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. In essence, a Turing machine is imagined to be a simple computer that reads and writes symbols one at a time on an endless tape by strictly following a set of rules. It determines what action it should perform next according to its internal state and what symbol it currently sees. An example of one of a Turing Machine's rules might thus be: "If you are in state 2 and you see an 'A', change it to 'B' and move left."
has abstract
Eine nichtdeterministische Tur ...... e Übergangsrelation verwendet.
@de
In theoretical computer scienc ...... ove left, and stay in state 3.
@en
Máquina de Turing não-determin ...... ato finito não-determinístico.
@pt
Une machine de Turing non déte ...... ctivables, pour un état donné.
@fr
В теоретической информатике не ...... минированный конечный автомат.
@ru
如果不加特殊说明，通常所说的图灵机都是确定型图灵机。非确定型 ...... P = NP之前，所有的NPC问题都只有指数时间复杂度算法。
@zh
非決定性チューリング機械（ひけっていせいチューリングきかい、 ...... ートマトンのように働く制御機構を持つチューリング機械である。
@ja
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
742,512,365
subject
hypernym
type
comment
Eine nichtdeterministische Tur ...... e Übergangsrelation verwendet.
@de
In theoretical computer scienc ...... ange it to 'B' and move left."
@en
Máquina de Turing não-determin ...... ato finito não-determinístico.
@pt
Une machine de Turing non déte ...... ctivables, pour un état donné.
@fr
В теоретической информатике не ...... минированный конечный автомат.
@ru
如果不加特殊说明，通常所说的图灵机都是确定型图灵机。非确定型 ...... 技巧来遍历 的计算树。具体证明如下： 对于非确定型图灵机 。
@zh
非決定性チューリング機械（ひけっていせいチューリングきかい、 ...... ートマトンのように働く制御機構を持つチューリング機械である。
@ja
label
Machine de Turing non déterministe
@fr
Máquina de Turing não determinística
@pt
Nichtdeterministische Turingmaschine
@de
Non-deterministic Turing machine
@en
Недетерминированная машина Тьюринга
@ru
非決定性チューリングマシン
@ja
非确定型图灵机
@zh