Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!usc!snorkelwacker.mit.edu!bloom-beacon!dont-send-mail-to-path-lines
From: cgl@t13.Lanl.GOV (Chris Langton)
Newsgroups: comp.theory.cell-automata
Subject: Berelekamp/Conway proof...
Message-ID: <9102191525.AA08177@t13.lanl.gov>
Date: 19 Feb 91 15:25:03 GMT
Sender: daemon@athena.mit.edu (Mr Background)
Distribution: inet
Organization: The Internet
Lines: 30


angelo@gem.stack.urc.tue.nl writes:

>  .....because now I have also read 'Winning ways'.
>  I believe that the Life computer presented there (or rather the 
>  elements to build one) will not work. I hope Callahan's TM will.

  Can you expand on your doubts about this proof? 
  
  I have implemented many of the components, and they seem to work
  as advertised...
  
  Where do you think the Life computer presented in Winning Ways 
  breaks down?
  
   Cheers!

   Chris Langton

   Complex Systems Group
   MS B213, Theoretical Division	Phone: (505) 667-9471
   Los Alamos National Laboratory	Email: cgl@t13.lanl.gov
   Los Alamos, New Mexico, USA		FAX:   (505) 665-3003
   87545

<<<<<<<<<<<<<<<<<<<...Its...Its...Its Alive!...>>>>>>>>>>>>>>>>>>>