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
Facts
3 properties- Instance of
- mathematical concept
- Subclass of
- Turing machine[3]
- Named after
- Alan Turing[2]
🏷️ Also known as
en non-deterministic Turing machine
en NTM
en nondeterministic Turing machine
ar آلة تورنغ غير الحتمية
da Nondeterministisk Turingmaskine
da ikke-deterministisk Turingmaskine
de nichtdeterministische Turingmaschine
de NTD
de NDTM
fa ماشین تورینگ غیرقطعی
fr machine de Turing non deterministe
fr machine de Turing non déterministe
fr machine de Turing non-déterministe
he מכונת טיורינג א-דטרמיניסטית
he מכונת טיורינג אי דטרמיניסטית
he מכונת טיורינג אי-דטרמיניסטית
he מכונת טיורינג לא דטרמיניסטית
he מכונת טיורינג לא-דטרמיניסטית
hu nemdeterminisztikus Turing-gép
ja 非決定性チューリングマシン
🔖 Identifiers · 7
- OpenAlex ID
- C15190523
- BabelNet ID
- 01488796n
- Dictionary of Algorithms and Data Structures ID
- nondetermTuringMach
- Freebase ID
- /m/05hsk
- Microsoft Academic ID (discontinued)
- 15190523
- PlanetMath ID
- NondeterministicTuringMachine
- ProofWiki ID
- Definition:Nondeterministic_Turing_Machine
🔗 Connections
Subtypes 2
Created notable works 1
Named after 1
Subclass of 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
non-deterministic Turing machine is a mathematical concept[1].