Turing machines have a formal symbol alphabet, state and transition-rules based description of how a computation is done.
The Actor Model is sometimes mentioned as a more powerful computational-model than Turing machines (not in what it can compute, but in other aspects).
- Is The Actor Model a full fledged Turning machine alternative as a computational model?
- Does The Actor Model also have such a symbol-based formal computation description akin to the Turing machine?
- Are the actors assumed to be Turing machine equivalent - since each message is processed sequentially (and atomically)?
There are many theoretical results based on Turing machines, e.g. the halting problem, decidability, relation to Gödel's incompleteness theorem etc.
Can these proofs be formally generalize to the Actor Model? Has this been done?