deterministic Turing machine

English

Noun

deterministic Turing machine (plural deterministic Turing machines)

  1. (computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read.
    Coordinate term: nondeterministic Turing machine
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.