fw@itk.unit.no (Fredrik Wilhelmsen) (11/27/90)
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