Tell Me A Joke

The Wolfram|Alpha search engine returns a different mathematical joke for a "Tell me a joke" query.

Wolfram Mathematica Online Integrator

This online integrator from Wolfram is actually pretty cool.

The Simplest Universal Turing Machine Is Proved

Stephen Wolfram comments on the simplest universal Turing machine found.

See my previous blog as well.

For those of us that this is over our heads, buy his book, A New Kind of Science, for further explanation (which I hope to do soon).

Wolfram 2,3 Turing Machine Research Prize

A universal Turing machine is powerful enough to emulate any standard computer.
The question is: how simple can the rules for a universal Turing machine be?

Since the 1960s it has been known that there is a universal 7,4 machine. In A New Kind of Science, Stephen Wolfram found a universal 2,5 machine, and suggested that the particular 2,3 machine that is the subject of this prize might be universal.

The prize is for determining whether or not the 2,3 machine is in fact universal.

Click here for more information.