nondeterministic Turing machine

English

Noun

nondeterministic Turing machine (plural nondeterministic Turing machines)

  1. (computer science) 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.
    Coordinate term: deterministic Turing machine

Translations

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.