non-deterministic Turing machine (Q1190223)

From Wikidata
Jump to: navigation, search
may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
  • NTM
  • Non-deterministic Turing machine, NTM
edit
Language Label Description Also known as
English
non-deterministic Turing machine
may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
  • NTM
  • Non-deterministic Turing machine, NTM

Statements

Identifiers