Re:Actor Model of Computation (2010) [pdf]
by jchassoul on Thursday August 02, 2018 @12:35PM
(#17672847)
The statement is true, Actor systems can handle uncertainty in ways that Turing Machines can not.
[ Parent
| on HN ]
Re:Actor Model of Computation (2010) [pdf]
by imode on Thursday August 02, 2018 @01:56PM
(#17673741)
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.
Re:Actor Model of Computation (2010) [pdf]
by jchassoul on Thursday August 02, 2018 @04:04PM
(#17674977)
That is wrong, Actor systems have a property called "Unbounded nondeterminism" nondeterministic TM have only bounded nondeterminism.
Re:Actor Model of Computation (2010) [pdf]
by carlehewitt on Saturday August 04, 2018 @06:24PM
(#17688716)
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.
Re:Actor Model of Computation (2010) [pdf]
by carlehewitt on Friday August 10, 2018 @08:19PM
(#17737594)
As explained in the articles referenced, Actor systems have unbounded nondeterminism because of indeterminacy.
No "hypercomputation" is required ;-)