ホーム > Term: nondeterministic Turing machine
nondeterministic Turing machine
A Turing machine which has more than one next state for some combinations of contents of the current cell and current state. An input is accepted if any move sequence leads to acceptance.
- スピーチの一部 noun
- 産業/ドメイン コンピュータサイエンス
- カテゴリ Algorithms & data structures
- Government Agency: NIST
0
作成者
- GeorgeV
- 100% positive feedback