Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!usc!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!nuug!sigyn.idt.unit.no!sigyn.idt.unit.no!fw
From: fw@itk.unit.no (Fredrik Wilhelmsen)
Newsgroups: comp.theory.cell-automata
Subject: Busy Beaver
Message-ID: <FW.90Nov27112711@gro.itk.unit.no>
Date: 27 Nov 90 10:27:11 GMT
Sender: news@idt.unit.no (Usenet news admin)
Distribution: comp
Organization: Norwegian Institute of Technology / SINTEF, Trondheim, Norway
Lines: 6


I don't know if this is the right news-group for this, but can anyone
tell me what is the latest news about the busy-beaver problem. Which
finite automata can generate the longest tape (and stop), using as few
states and letters as possible?

Thank you for any help.
--
Fredrik Wilhelmsen
Division of Engineering Cybernetics     : Phone +47 7 594375
The Norwegian Institute of Technology   : Fax   +47 7 594399
N-7034 Trondheim                        : Email fw@itk.unit.no
NORWAY