Nondeterministic Turing machine
May have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
In theoretical computer science and computational theory, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike the standard, deterministic, Turing machine.
Nº Q1190223 ★
Común · Saberes
Nondeterministic Turing machine
May have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
In theoretical computer science and computational theory, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike the standard, deterministic, Turing machine.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
In theoretical computer science and computational theory, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike the standard, deterministic, Turing machine. NTMs are sometimes used in thought experiments to examine the abilities and limits of computers. One of the most important open problems in theoretical computer science is the P versus NP problem, which (among other equivalent formulations) concerns the question of how difficult it is to simulate nondeterministic computation with a deterministic computer.
Texto: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
-
NP (clase de complejidad)
Clase de complejidad computacional
Nº Q628036 ★★★
Sin ofertas
-
Máquina de Turing universal
Máquina de Turing que puede simular una máquina de Turing arbitraria en la entrada arbitraria
Nº Q2703890 ★★
Sin ofertas
-
Máquina de Turing
Máquina teórica ideada por Alan Turing, usada para estudiar los límites de las máquinas
Nº Q163310 ★★★★
Sin ofertas
-
T
Turing completo
Un sistema Turing completo es aquel que tiene un poder computacional equivalente a la máquina de Turing universal
Nº Q197970 ★★★
Sin ofertas
-
Ensayo no destructivo
Prueba para materiales
Nº Q626700 ★★
Sin ofertas
-
N
NL (clase de complejidad)
Clase de complejidad
Nº Q12857599 ★
Sin ofertas