Hacker News new | ask | show | jobs
by arglebarnacle 2873 days ago
You can see a flash of that in this article with "Actor systems can perform computations that are impossible by Turing Machines"
1 comments

The statement is true, Actor systems can handle uncertainty in ways that Turing Machines can not.
Actor 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.
That is wrong, Actor systems have a property called "Unbounded nondeterminism" nondeterministic TM have only bounded nondeterminism.

https://en.wikipedia.org/wiki/Unbounded_nondeterminism

Jean 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.

I'm sorry, but unless you produce a proof of hypercomputation with models that have unbounded determinism, you're a crank.
As explained in the articles referenced, Actor systems have unbounded nondeterminism because of indeterminacy.

No "hypercomputation" is required ;-)