{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087085},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_32","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:32:49Z","timestamp":1502796769000},"page":"409-417","source":"Crossref","is-referenced-by-count":0,"title":["Busy Beaver Scores and Alphabet Size"],"prefix":"10.1007","author":[{"given":"Holger","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00224-001-1052-0","volume":"35","author":"AM Ben-Amram","year":"2002","unstructured":"Ben-Amram, A.M., Petersen, H.: Improved bounds for functions related to Busy Beavers. Theory Comput. Syst. 35(1), 1\u201311 (2002)","journal-title":"Theory Comput. Syst."},{"issue":"162","key":"32_CR2","first-page":"647","volume":"40","author":"AH Brady","year":"1983","unstructured":"Brady, A.H.: The determination of the value of Rado\u2019s noncomputable function \n            $$\\Sigma (k)$$\n           for four-state Turing machines. Math. Comput. 40(162), 647\u2013665 (1983)","journal-title":"Math. Comput."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Brady, A.H.: The Busy Beaver game and the meaning of life. In: Herken, R. (ed.) The Universal Turing Machine: A Half-Century Survey, 2nd Edition, pp. 237\u2013254. Springer, Heidelberg (1995)","DOI":"10.1007\/978-3-7091-6597-3_9"},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Chaitin, G.: Computing the Busy Beaver function. In: Cover, T.M., Gopinath, B. (eds.) Open Problems in Communication and Computation, pp. 108\u2013112. Springer, Heidelberg (1987). doi:\n10.1007\/978-1-4612-4808-8_28","DOI":"10.1007\/978-1-4612-4808-8_28"},{"key":"32_CR5","unstructured":"Harland, J.: Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo). \nhttps:\/\/arxiv.org\/abs\/1610.03184v1\n\n (2016)"},{"issue":"5","key":"32_CR6","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1038\/scientificamerican0584-86","volume":"250","author":"JE Hopcroft","year":"1984","unstructured":"Hopcroft, J.E.: Turing machines. Sci. Am. 250(5), 70\u201380 (1984)","journal-title":"Sci. Am."},{"key":"32_CR7","volume-title":"Logic and Algorithms: With Applications to the Computer and Information Sciences","author":"RR Korfhage","year":"1966","unstructured":"Korfhage, R.R.: Logic and Algorithms: With Applications to the Computer and Information Sciences. Wiley, New York (1966)"},{"issue":"2","key":"32_CR8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/321264.321270","volume":"12","author":"S Lin","year":"1965","unstructured":"Lin, S., Rado, T.: Computer studies of Turing machine problems. J. Assoc. Comput. Mach. 12(2), 196\u2013212 (1965)","journal-title":"J. Assoc. Comput. Mach."},{"key":"32_CR9","first-page":"247","volume":"40","author":"H Marxen","year":"1990","unstructured":"Marxen, H., Buntrock, J.: Attacking the Busy Beaver 5. Bull. Eur. Assoc. Theoret. Comput. Sci. (EATCS) 40, 247\u2013251 (1990)","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci. (EATCS)"},{"key":"32_CR10","unstructured":"Marxen, H.: Currently Known Results. (Download 25 April 2017). \nhttp:\/\/www.drb.insel.de\/~heiner\/BB"},{"issue":"1\u20133","key":"32_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2004.05.008","volume":"326","author":"P Michel","year":"2004","unstructured":"Michel, P.: Small Turing machines and generalized Busy Beaver competition. Theoret. Comput. Sci. 326(1\u20133), 45\u201356 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR12","unstructured":"Michel, P.: The Busy Beaver Competition: A Historical Survey. \nhttps:\/\/arxiv.org\/abs\/0906.3749v4\n\n (2016)"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1002\/j.1538-7305.1962.tb00480.x","volume":"41","author":"T Rado","year":"1962","unstructured":"Rado, T.: On non-computable functions. Bell Syst. Tech. J. 41, 877\u2013884 (1962)","journal-title":"Bell Syst. Tech. J."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A universal Turing machine with two internal states. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies (AM-34), pp. 157\u2013166. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-007"},{"key":"32_CR15","unstructured":"Yedidia, A., Aaronson, S.: A relatively small Turing machine whose behavior is independent of set theory. Complex Syst. 25(4) (2016). \nhttp:\/\/www.complex-systems.com\/issues\/25-4.html"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:41:43Z","timestamp":1502797303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}