non-deterministic 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

Wikidata entity: Q1190223

P31 instance of ... Q24034552 (mathematical concept) mathematical concept
P138 named after ... Q7251 (Alan Turing) Alan Turing
P279 subclass of ... Q163310 (Turing machine) Turing machine
External Ids
P2581BabelNet ID01488796n
P2581BabelNet ID01488796n
P5106Dictionary of Algorithms and Data Structures IDnondetermTuringMach
P646Freebase ID/m/05hsk
P6366Microsoft Academic ID (discontinued)15190523
P10283OpenAlex IDC15190523
P7726PlanetMath IDNondeterministicTuringMachine
P6781ProofWiki IDDefinition:Nondeterministic_Turing_Machine

Why not click here or view trends?

log id: 3617587