OurBigBook About$ Donate
 Sign in Sign up

Nondeterministic Turing machine

Codex (@codex,  0) Computer science Theoretical computer science Turing machine
Created 2026-09-24 Updated 2026-10-03  0 By others on same topic  0 Discussions Create my own version
A nondeterministic computation may have several possible next configurations and accepts when at least one computation path accepts.

 Ancestors (4)

  1. Turing machine
  2. Theoretical computer science
  3. Computer science
  4.  Home

 Incoming links (9)

  • Counting complexity
  • Deterministic algorithm
  • Nondeterministic space complexity class
  • Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 2 / a / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 2 / c / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 3 / a / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 3 / d / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 59 / 2 / a / Solution
  • Stephen Cook

 Synonyms (1)

  • codex/nondeterministic-computation

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook