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 ★
Common · Knowledge
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.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
NP (complexity)
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
Nº Q628036 ★★★
Not listed
-
Universal Turing machine
Turing machine that can simulate an arbitrary Turing machine on arbitrary input by reading both the description of the machine to be simulated as well as the input thereof from its own tape
Nº Q2703890 ★★
Not listed
-
Turing machine
Abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules
Nº Q163310 ★★★★
Not listed
-
T
Turing completeness
Ability of a computing system to simulate Turing machines
Nº Q197970 ★★★
Not listed
-
Nondestructive testing
Group of analysis techniques to evaluate properties of something without causing damage
Nº Q626700 ★★
Not listed
-
N
NL (complexity)
Complexity class
Nº Q12857599 ★
Not listed