Word.ws English Dictionary

nondeterministic Turing machine

nondeterministic Turing machine noun: a variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read.

Noun

nondeterministic Turing machine (plural nondeterministic Turing machines)

  1. A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read.

Forms of nondeterministic Turing machine

pluralnondeterministic Turing machines

Questions about nondeterministic Turing machine

What does nondeterministic Turing machine mean?
Nondeterministic Turing machine means a variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read.
What part of speech is nondeterministic Turing machine?
Nondeterministic Turing machine is a noun.
What is the plural of nondeterministic Turing machine?
The plural of nondeterministic Turing machine is nondeterministic Turing machines.

Words near nondeterministic Turing machine in the dictionary

  1. nondeterminisms
  2. nondeterminist
  3. nondeterministic
  4. nondeterministic polynomial time
  5. nondeterministic polynomial times
  6. nondeterministic Turing machine
  7. nondeterministic Turing machines
  8. nondeterministically
  9. nondeterminists
  10. nondeterred
  11. nondeterrent

Source and license

Adapted from Wiktionary: nondeterministic Turing machine (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “nondeterministic Turing machine.” Word.ws, https://word.ws/nondeterministic_turing_machine. Based on Wiktionary, CC BY-SA 4.0.