A New Kind of Science [Hardcover]

On page 27 Wolfram explains "probably the single most surprising discovery I have ever made:" a simple program can produce output that seems irregular and complex.

This has been known for six decades. Every computer science (CS) student knows the dovetailer, a very simple 2 line program that systematically lists and executes all possible programs for a universal computer such as a Turing machine (TM). It computes all computable patterns, including all those in Wolfram's book, embodies the well-known limits of computability, and is basis of uncountable CS exercises.

Wolfram does know (page 1119) Minsky's very simple universal TMs from the 1960s. Using extensive simulations, he finds a slightly simpler one. New science? Small addition to old science. On page 675 we find a particularly simple cellular automaton (CA) and Matthew Cook's universality proof(?). This might be the most interesting chapter. It reflects that today's PCs are more powerful systematic searchers for simple rules than those of 40 years ago. No new paradigm though.

Was Wolfram at least first to view programs as potential explanations of everything? Nope. That was Zuse. Wolfram mentions him in exactly one line (page 1026): "Konrad Zuse suggested that [the universe] could be a continuous CA." This is totally misleading. Zuse's 1967 paper suggested the universe is DISCRETELY computable, possibly on a DISCRETE CA just like Wolfram's. Wolfram's causal networks (CA's with variable toplogy, chapter 9) will run on any universal CA a la Ulam & von Neumann & Conway & Zuse.... Page 715 explains Wolfram's "key unifying idea" of the "principle of computational equivalence:" all processes can be viewed as computations. Well, that's exactly what Zuse wrote 3 decades ago.

Chapter 9 (2nd law of thermodynamics) elaborates (without reference) on Zuse's old insight that entropy cannot really increase in deterministically computed systems, although it often SEEMS to increase. Wolfram extends Zuse's work by a tiny margin, using today's more powerful computers to perform experiments as suggested in Zuse's 1969 book. I find it embarassing how Wolfram tries to suggest it was him who shifted a paradigm, not the legendary Zuse.

Some reviews cite Wolfram's previous reputation as a physicist and software entrepreneur, giving him the benefit of the doubt instead of immediately dismissing him as just another plagiator. Zuse's reputation is in a different league though: He built world's very first general purpose computers (1935-1941), while Wolfram is just one of many creators of useful software (Mathematica). Remarkably, in his history of computing (page 1107) Wolfram appears to try to diminuish Zuse's contributions by only mentioning Aiken's later 1944 machine.

On page 465 ff (and 505 ff on multiway systems) Wolfram asks whether there is a simple program that computes the universe. Here he sounds like Schmidhuber in his 1997 paper "A Computer Scientist's View of Life, the Universe, and Everything." Schmidhuber applied the above-mentioned simple dovetailer to all computable universes. His widely known writings come out on top when you google for "computable universes" etc, so Wolfram must have known them too, for he read an "immense number of articles books and web sites" (page xii) and executed "more than a hundred thousand mouse miles" (page xiv). He endorses Schmidhuber's "no-CA-but-TM approach" (page 486, no reference) but not his suggestion of using Levin's asymptotically optimal program searcher (1973) to find our universe's code.

On page 469 we are told that the simplest program for the data is the most probable one. No mention of the very science based on this ancient principle: Solomonoff's inductive inference theory (1960-1978); recent optimality results by Merhav & Feder & Hutter. Following Schmidhuber's "algorithmic theories of everything" (2000), short world-explaining programs are necessarily more likely, provided the world is sampled from a limit-computable prior distribution. Compare Li & Vitanyi's excellent 1997 textbook on Kolmogorov complexity.

On page 628 ff we find a lot of words on human thinking and short programs. As if this was novel! Wolfram seems totally unaware of Hutter's optimal universal rational agents (2001) based on simple programs a la Solomonoff & Kolmogorov & Levin & Chaitin.

Wolfram suggests his simple programs will contribute to fine arts (page 11), neither mentioning existing, widely used, very short, fractal-based programs for computing realistic images of mountains and plants, nor the only existing art form explicitly based on simple programs: Schmidhuber's low-complexity art.

Wolfram talks a lot about reversible CAs but little about Edward Fredkin & Tom Toffoli who pioneered this field. He ignores Wheeler's "it from bit," Tegmark & Greenspan & Petrov & Marchal's papers, Moravec & Kurzweil's somewhat related books, and Greg Egan's fun SF on CA-based universes (Permutation City, 1995).

When the book came out some non-expert journalists hyped it without knowing its contents. Then cognoscenti had a look at it and recognized it as a rehash of old ideas, plus pretty pictures. And the reviews got worse and worse. As far as I can judge, positive reviews were written only by people without basic CS education and little knowledge of CS history. Some biologists and even a few physicists initially were impressed because to them it really seemed new. Maybe Wolfram's switch from physics to CS explains why he believes his thoughts are radical, not just reinventions of the wheel.

But he does know Goedel and Zuse and Turing. He must see that his own work is minor in comparison. Why does he desparately try to convince us otherwise? When I read Wolfram's first praise of the originality of his own ideas I just had to laugh. The tenth time was annoying. The hundredth time was boring. And that was my final feeling when I laid down this extremely repetitive book:exhaustion and boredom. In hindsight I know I could have saved my time. But at least I can warn others. Read more ›