Re: Overcoming Incompleteness

From: Stephen Paul King <stephenk1.domain.name.hidden>
Date: Fri, 25 May 2007 00:06:22 -0400

Dear Jesse,

    Hasn't Stephen Wolfram proven that it is impossible to "shortcut"
predictions for arbitrary behaviours of sufficienty complex systems?

http://www.stephenwolfram.com/publications/articles/physics/85-undecidability/


Stephen

----- Original Message -----
From: "Jesse Mazer" <lasermazer.domain.name.hidden>
To: <everything-list.domain.name.hidden>
Sent: Thursday, May 24, 2007 10:31 PM
Subject: Re: Overcoming Incompleteness


snip
> The same thing would be true even if you replaced an individual in a
> computer simulation with a giant simulated community of mathematicians who
> could only output a given theorem if they had a unanimous vote, and where
> the size of the community was constantly growing so the probability of
> errors should be ever-diminishing...although they might hope that they
> might
> never make an error even if the simulation ran forever, they couldn't
> rigorously prove this unless they found some shortcut for predicting their
> own community's behavior better than just letting the program run and
> seeing
> what would happen (if they did find such a shortcut, this would have
> strange
> implications for their own feeling of free will!)
>
> Jesse
>


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to everything-list.domain.name.hidden
To unsubscribe from this group, send email to everything-list-unsubscribe.domain.name.hidden
For more options, visit this group at http://groups.google.com/group/everything-list?hl=en
-~----------~----~----~----~------~----~------~--~---
Received on Fri May 25 2007 - 00:06:30 PDT

This archive was generated by hypermail 2.3.0 : Fri Feb 16 2018 - 13:20:14 PST