Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-8449
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLudewig, Jochende
dc.contributor.authorSchult, Uwede
dc.contributor.authorWankmüller, Frankde
dc.date.accessioned2016-02-23de
dc.date.accessioned2016-03-31T11:46:43Z-
dc.date.available2016-02-23de
dc.date.available2016-03-31T11:46:43Z-
dc.date.issued1983de
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-93526de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/8466-
dc.identifier.urihttp://dx.doi.org/10.18419/opus-8449-
dc.description.abstractThis is a report on the results of a competition which was initiated on the occasion of the 6th GI-conference on Theoretical Computer Science, which took place at the University of Dortmund from January 5th to 7th, 1983. It was asked for the best solution of the 5-state Busy-Beaver-Game. At first we make some historical remarks, introduce the formalism, and list some results. Then the two best solutions are described. Next we make some remarks on the behaviour of good beavers and on the strange behaviour of some Turing machines. Zoological names were given to the latter machines. The amusing results are written down in the last chapter. In the appendix you can find a lot of examples.en
dc.language.isoende
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.classificationTuring-Maschine , Busy-beaver-Problemde
dc.subject.ddc004de
dc.titleChasing the busy-beaver : notes and observations on a competition to find the 5-state busy beaveren
dc.typeworkingPaperde
ubs.bemerkung.externDortmund : Univ., 1983 (Bericht / Abteilung Informatik, Universität Dortmund 159)de
ubs.fakultaetFakultätsübergreifend / Sonstige Einrichtungde
ubs.institutSonstige Einrichtungde
ubs.opusid9352de
ubs.publikation.noppnyesde
ubs.publikation.typArbeitspapierde
Appears in Collections:15 Fakultätsübergreifend / Sonstige Einrichtung

Files in This Item:
File Description SizeFormat 
lud20.pdf9,23 MBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.