[FOM] Wolfram 2,3 Turing Machine Prize

Apostolos Syropoulos asyropoulos at gmail.com
Fri Oct 26 12:10:27 EDT 2007

In http://mathworld.wolfram.com/PrincipleofComputationalEquivalence.html one


Almost all processes that are not obviously simple can be viewed as
computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717).

More specifically, the principle of computational equivalence says that
systems found in the natural world can perform computations up to a maximal
("universal") level of computational power, and that most systems do in fact
attain this maximal level of computational power. Consequently, most systems
are computationally equivalent. For example, the workings of the human brain
or the evolution of weather systems can, in principle, compute the same
things as a computer. Computation is therefore simply a question of
translating inputs and outputs from one system to another.

Or in plain English: the apotheosis of computationalism.


2007/10/26, Bill Taylor <W.Taylor at math.canterbury.ac.nz>:
> It's a brilliant discovery, but...
> -> It also provides strong further evidence for Wolfram's Principle
> -> of Computational Equivalence.
> ...can someone please tell us exactly what IS this alleged
>                   "Wolfram's Principle of Computational Equivalence" ?
> -- Bill Taylor
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> http://www.cs.nyu.edu/mailman/listinfo/fom

Apostolos Syropoulos
366, 28th October Str.
GR-671 00 Xanthi, GREECE
Web-page at http://obelix.ee.duth.gr/~apostolo
Blog at http://asyropoulos.wordpress.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: /pipermail/fom/attachments/20071026/b9badd1b/attachment-0001.html

More information about the FOM mailing list