***** To join INSNA, visit http://www.insna.org *****
Someone found a trivial-ish (as such things are...) bug in this proof ;)
> [Note, nothing to do with networks, but it is a milestone. BW]
> Wolfram's 2,3 Turing Machine Is Universal , Wolfram Research Press
> Excerpts: Wolfram Research and Stephen Wolfram today announced that
> 20-year-old Alex Smith of Birmingham, UK has won the US $25,000 Wolfram
> 2,3 Turing Machine Research Prize. (...) This result ends a half-century
> quest to find the simplest universal Turing machine.
> It demonstrates that a remarkably simple system can perform any
> computation that can be done by any computer.
> *  Wolfram's 2,3 Turing Machine Is Universal,  Marcus Wynne,
> 2007/10/24, Wolfram Research Press Release
>  http://www.wolframscience.com/prizes/tm23/solved.html
>  mailto:[log in to unmask]
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.