недетерминированная машина Тьюринга
Sign in to saveAlso known as NTM, nondeterministic 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
In the Vinony graph
Vinony's link graph records 275 inbound references to недетерминированная машина Тьюринга, and connects out to Turing machine, computer science and Alan Turing.
It is catalogued under the topic Turing machine.
Vinony links it to 22 Wikipedia language editions.
Article · Русский
Недетерминированная машина Тьюринга (НМТ) — машина Тьюринга, функция перехода которой представляет собой недетерминированный конечный автомат (НКА).
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
Turing machine
Entity
computer science
Entity
Alan Turing
Entity
International Standard Book Number
Entity
arXiv
Entity
thought experiment
Entity
tree
Entity
quantum computing
Entity
theoretical computer science
Entity
qubit
Entity
P versus NP problem
Entity
breadth-first search
Entity
quantum superposition
Entity
NP-complete
Entity
time complexity
Entity
Christos Papadimitriou
Entity
universal Turing machine
Entity
probabilistic Turing machine
Entity
quantum Turing machine
Entity
Scott Aaronson
Entity