3 ms·
You can see a flash of that in this article with "Actor systems can perform computations that are impossible by Turing Machines"
by arglebarnacle 8y ago
You can see a flash of that in this article with "Actor systems can perform computations that are impossible by Turing Machines"
- jchassoul 8y agoThe statement is true, Actor systems can handle uncertainty in ways that Turing Machines can not.
- imode 8y agoActor systems are no more able to handle uncertainty than Turing Machines are, either via nondeterministic TMs or by deterministic TMs. This is basic computability theory.
- jchassoul 8y agoThat is wrong, Actor systems have a property called "Unbounded nondeterminism" nondeterministic TM have only bounded nondeterminism. https://en.wikipedia.org/wiki/Unbounded_nondeterminism https://en.wikipedia.org/wiki/Unbounded_nondeterminism
- carlehewitt 8y agoJean is correct! Of course, unbounded nondeterminism is a somewhat artificial example. However, the extra power of Actors over Turing Machines is critical for IoT and the implementation of Intelligent Systems.
- imode 8y agoI'm sorry, but unless you produce a proof of hypercomputation with models that have unbounded determinism, you're a crank.
- carlehewitt 8y agoAs explained in the articles referenced, Actor systems have unbounded nondeterminism because of indeterminacy. No "hypercomputation" is required ;-)
- imode 8y agoPlease produce a proof regarding how this makes the Actor Model more powerful than the traditional Turing Machines. I suspect you're a crank.