9. Ограниченный недетерминизм
Each computational step was from one global state of the
computation to the next global state. The global state
approach was continued in automata theory for finite state
machines and push down stack machines, including their
nondeterministic versions.
Such nondeterministic automata have the property of
bounded nondeterminism; that is, if a machine always halts
when started in its initial state, then there is a bound on the
number of states in which it halts.
(Gordon Plotkin, 1976)
11. Определение актора
Актор – вычислительная сущность
• Отправить конечное число сообщений
другим акторам
• Создать конечное число акторов
• Выбрать поведение для приема
следующего сообщения
17. Неограниченный недетерминизм
Theorem. There are nondeterministic
computable functions on integers that
cannot be implemented by a nondeterministic
Turing machine
[Clinger, 1981]