non-deterministic Turing machine
(Q1190223)
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
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
Language:
Current Data About
non-deterministic Turing machine
other details
aliases |
NTM nondeterministic Turing machine |
description | 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 |
External Links
(P646) |
/m/05hsk
|
(P2581) |
01488796n
|
(P5106) |
nondetermTuringMach
|
(P6366) |
15190523
|
(P6781) |
Definition:Nondeterministic_Turing_Machine
|
(P7726) |
NondeterministicTuringMachine
|
(P10283) |
C15190523
|