But since Turing machines can emulate multiple Turing machines, any problem that can be completed by multiple machines communicating can be solved by 1 Turing machine. As such, the computational power is exactly the same.
Nondeterministic Turing Machine has only bounded
nondeterminism. That is, for a given input a Nondeterministic
Turing Machine can only explore the number of alternatives
bounded by its input. Actors do not have the limitation.