Alpha Geek

If their arguments are invalid, then perhaps they should be rebutted, or perhaps someone could link to another resource where they have been rebutted.

That being said, I took a look at your website and GitHub (not to mention your employer, Wolfram Research) and it's obvious you know what you're talking about - I don't think you should be being downvoted as heavily in this thread as you are. Plus you made a Futurama reference, so you're obviously a cool dude.

My point is, let's all avoid implying that people who don't agree with us aren't qualified to discuss this subject. I think both of us are, and Wolfram is a pretty polarizing subject - one that all sides need to keep civil about sometimes.

Traditional computer science considers computer programs to be merely a means to an end.

A quite delicious irony is given by the example of Naiver Stokes equations. They are themselves an idealization of the flow of fluids composed of discrete particles. Because of our obsession with continuous models, we mostly resort to laboriously solving them numerically -- but it turns out that simple lattice gas cellular automaton models are actually 1) fairly accurate 2) much more computationally efficient, and 3) more suggestive of the underlying microscale physics.

To step back a bit, a helpful analogy would be that simple computations are the 21st century equivalent of differential equations, which were studied rigorously in their own right starting in the 18th century, often prior to their application to concrete problems.

Whether this intuition will turn out to be prescient, or whether it will fizzle out, is another question.

This means that it is possible to express the proofs of your statements in code.

On the other hand, non-halting programs are AFAIK beyond the reach of formal logic, and as consequence, the set of logical proofs (or more accurately, its isomorphic twin) is a subset of the set of all computer programs.

I'll list just a couple of errors that would be impossible to make if one had read even most of the book. Wolfram often pedantically reiterates the same points, so keep in mind that these things are hard to miss:

1) "The Principle of Computational Equivalence" does not state that all-is-computation. It states that whatever 'objective' means we use to quantify computational complexity, we will discover that all computations are either trivial or of equal complexity. I.e. computational complexity (where this is crucially left undefined) "saturates" very quickly in the world of natural computations, no matter how you decide to measure complexity.

2) SW's discovery of universality among the simplest CAs is not a triviality, because unlike what this guy says, the dovetailer is not a simple program -- it is explicitly set up to be universal (in a manner). Its Turing machine rule number is probably in the trillions or higher. Whereas the surprise is that even amongst the very simplest programs, universality is easy to find.

To use an analogy, string theorists would cry with joy if it turned out that there was some small number of "simplest natural string theories" and one of them gave us all the known particles of the Standard Model.

3) Asymptotically optimal program search, in practice, isn't the way you would hunt for universes, and it is relatively easy to see why (TL;DR for now). Schmidhuber's academic work is of no practical relevance to the chapter on physics, although its cool from a math geek perspective. Same with maximally rational agents.

And the main idea here is just Occam's razor, not some arcane formulation of maximum predictive accuracy under a strange universal prior of symbol sequences, as cool as that sounds.

4) Wolfram doesn't propose the universe is a discrete CA, although everyone seems to think this. He makes all the obvious points about why it is unlikely to be so, and goes on to propose a graph automata model as being a suitable generalization of space and time.

So yeah, don't trust every well written review you read on Amazon.

As for not referencing people enough, I have sympathy with this criticism. On the other hand, as the book delves into a million and one different domains, the inquisitive reader would get extremely bogged down if he were to descend into the jargon of each individual field. And you would need to descend into jargon to say anything other than light summarizations of what has come before.

But these light summarizations do exist, in the extensive notes. In fact they're often not so light -- for example there is quite an interesting discussion of why the Pressburger arithmetic and the theory of intermediate degrees isn't a contradiction of the principle of computational equivalence.

Many times when one first thinks that Wolfram is being simplistic or naive, it turns out that he's gone into a lot more depth in the notes (I assume to avoid getting bogged down in the main text).

He really does know his shit.

Disclosure: I work on Wolfram|Alpha. But I have a brain, and I can think for myse.... ALL HAIL THE HYPNOTOAD