However, the Principle of Computational Equivalence is really kind of useless, because it doesn't take into account computational complexity...
Yes, you can probably simulate any complex systems phenomenon using a CA. But, with what pragmatic penalty in terms of computational cost? Some may be interested in a review of Wolfram's book that I wrote many moons ago... http://www.goertzel.org/dynapsyc/2002/WolframReview.htm -- Ben On 10/27/07, John G. Rose <[EMAIL PROTECTED]> wrote: > > > From: Mike Dougherty [mailto:[EMAIL PROTECTED] > > > > http://blog.wolfram.com/2007/10/the_prize_is_won_the_simplest.html > > > > Can someone tell me what this means in the context of this list? > > > > Also, that "machine" appears to be fractal. Is it truly fractal, or > > am I incorrectly assuming that due to a grossly self-similar pattern? > > > Wolfram says that this is a piece of evidence for his "Principal of > Computational Equivalence". He's trying to prove that a few simple rules > generate (emerge) the whole universe, kind of like the registers on your > PC's CPU. > > John > > > ----- > This list is sponsored by AGIRI: http://www.agiri.org/email > To unsubscribe or change your options, please go to: > http://v2.listbox.com/member/?&; > ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=58289218-5571c3
