Actor Model of Computation (2010) [pdf]

Re:Actor Model of Computation (2010) [pdf] by curuinor on Wednesday August 01, 2018 @08:54PM (#17668434)

Hewitt is now kind of a crank. When Hofstadter came over for the Symsys thing in Stanford a few years back, Hewitt handed Hofstadter a little sheet of paper saying that mere contradiction allowed axiomatic systems to transcend Godel incompleteness theorems. Hofstadter: "Thanks, Carl." and then he threw it away when Hewitt wasn't looking. I think there's a thread in Lambda the Ultimate.

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by carlehewitt on Thursday August 02, 2018 @07:08PM (#17676196)

Unfortunately, it is very common to have difficulty with paradigm shifts :-(

Those of you near Denver can come to my BLAST 2018 lecture at 5PM on August 9 at the University of Denver with the following abstract: https://plus.google.com/+CarlHewitt-StandardIoT/posts/hh5CYE...

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by imode on Tuesday August 07, 2018 @11:52AM (#17707727)

You really don't understand computability at all, do you?

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by sctb on Tuesday August 07, 2018 @05:09PM (#17710822)

Please don't make personal attacks—just post civilly and substantively.

https://news.ycombinator.com/newsguidelines.html

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by imode on Tuesday August 07, 2018 @11:00PM (#17712894)

That's not a personal attack, it's an honest question.

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by carlehewitt on Friday August 10, 2018 @08:16PM (#17737583)

SCTB is correct.

Sticking to the subject matter is the way to go.

IMODE: Which part of the Actor Model theory of computation do you not understand?

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by arglebarnacle on Thursday August 02, 2018 @11:40AM (#17672273)

You can see a flash of that in this article with "Actor systems can perform computations that are impossible by Turing Machines"

[ Parent | on HN ]

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.

[ Parent | on HN ]

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.

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

[ Parent | on HN ]

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.

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by imode on Tuesday August 07, 2018 @11:50AM (#17707703)

I'm sorry, but unless you produce a proof of hypercomputation with models that have unbounded determinism, you're a crank.

[ Parent | on HN ]

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 ;-)

[ Parent | on HN ]

Re:Actor Model of Computation (2010) [pdf] by jchassoul on Wednesday August 01, 2018 @09:23PM (#17668571)

and yet it moves

[ Parent | on HN ]