Diferenças

Aqui você vê as diferenças entre duas revisões dessa página.

--- geopro:pedro:books:wolfram [2008/04/23 13:45] – pedro
+++ geopro:pedro:books:wolfram [2008/04/23 15:06] (atual) – pedro
@@ Linha 1: / Linha 1: @@
 ====== A New Kind of Science ======
-|Stephen Wolfram| [[http://www.wolframscience.com/nksonline/register.cgi?page=25&access=515235:786bfd76b8bb2d72|html]]|
+|Stephen Wolfram| [[http://www.wolframscience.com/nksonline/register.cgi?page=10&access=515232:b363182ea5ec4ad0|html]]|
 {{ http://www.leg.ufpr.br/~pedro/figures/wolfram.jpg}}
+{{http://www.leg.ufpr.br/~pedro/figures/rule90.jpg  }}
 One might have thought that if the rules of a program were simple then this would mean that its behaviour must also be correspondingly simple. For our everyday experience in building things tends to give us the intuition that creating complexity is somehow difficult, and requires rules or plans  that are themselves complex. But the pivotal discovery that I made some eighteen years ago is that in the world of programs such intuition is not close to correct.
@@ Linha 39: / Linha 41: @@
-{{http://www.leg.ufpr.br/~pedro/figures/rule90.jpg  }}
+{{http://www.leg.ufpr.br/~pedro/figures/wolfram-randomwalk.jpg  }}
+almost any rule whose behaviour is not obviously simple should ultimately be capable to
+achieving the same level of computational sophistication and should thus in effect
+be universal.
+Without the Principle of Computational Equivalende one might assume that different
+systems would always be able to perform completely different computations, and that
+in particular there would be no upper limit on the sophistication of computations
+that systems with sufficiently complicated structures would be able to perform.
+-oTuring Machines ARE UNIVERSAL, and it was proven decades before this book.
+:?: The point is that, as most simple a universal machine is, most complicated is to codify a program for it.