{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:02Z","timestamp":1725472022887},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540334606"},{"type":"electronic","value":"9783540334613"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-33461-3_12","type":"book-chapter","created":{"date-parts":[[2006,10,19]],"date-time":"2006-10-19T13:37:55Z","timestamp":1161265075000},"page":"305-319","source":"Crossref","is-referenced-by-count":0,"title":["Holger Petersen"],"prefix":"10.1007","member":"297","reference":[{"key":"12_CR1_12","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1109\/PGEC.1966.264572","volume":"EC-15","author":"A.H. Brady","year":"1966","unstructured":"A.H. Brady. The conjectured highest scoring machines for Rado\u2019s \u03a3 (k) for the value k = 4, IEEE Transactions on Electronic Computers, EC-15 (1966), 802-803.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"12_CR2_12","unstructured":"A.H. Brady. Solution of the non-computable \u201cBusy Beaver\u201d game for k = 4, ACM Computer Science Conference (Washington DC, 1975), 1975, 27."},{"key":"12_CR3_12","doi-asserted-by":"publisher","first-page":"647","DOI":"10.2307\/2007539","volume":"40","author":"A.H. Brady","year":"1983","unstructured":"A.H. Brady. The determination of the value of Rado\u2019s noncomputable function \u03a3 (k) for four-state Turing machines, Mathematics of Computation, 40 (1983), 647-665.","journal-title":"Mathematics of Computation"},{"key":"12_CR4_12","first-page":"237","volume-title":"The Busy Beaver Game and the meaning of Life, The Universal Turing Machine: A Half-Century Survey","author":"A.H. Brady","year":"1994","unstructured":"A.H. Brady. The Busy Beaver Game and the meaning of Life, The Universal Turing Machine: A Half-Century Survey (R. Herken, ed.), Springer-Verlag, Berlin, 1994, 237-254."},{"key":"12_CR5_12","unstructured":"M. Buro. Ein Beitrag zur Bestimmung von Rados \u03a3 (5) oder Wie f\u00e4ngt man flei\u00dfige Biber? Technical Report 146, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, 1990."},{"key":"12_CR6_12","first-page":"74","volume":"8","author":"J. Gregory","year":"1987","unstructured":"Gregory J. Chaitin. Computing the Busy Beaver function, Information, Randomness & Incompleteness: Papers on Algorithmic Information Theory, World Scientific, Series in Computer Science-Vol. 8, 1987, 74-76.","journal-title":"Papers on Algorithmic Information Theory, World Scientific, Series in Computer Science-Vol."},{"key":"12_CR7_12","first-page":"91","volume-title":"A lower bound on Rado\u2019s Sigma Function for binary Turing machines, Switching Circuit Theory and Logical Design, Proceedings of the Fifth Annual Symposium","author":"M.W. Green","year":"1964","unstructured":"M.W. Green. A lower bound on Rado\u2019s Sigma Function for binary Turing machines, Switching Circuit Theory and Logical Design, Proceedings of the Fifth Annual Symposium (Princeton, N.J., 1964), The Institute of Electrical and Electronics Engineers, Inc., 1964, 91-94."},{"key":"12_CR8_12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979."},{"key":"12_CR9_12","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/321264.321270","volume":"12","author":"S. Lin","year":"1965","unstructured":"S. Lin and T. Rado. Computer studies of Turing machine problems, Journal of the Association for Computing Machinery, 12 (1965), 196-212.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"12_CR10_12","unstructured":"H. Marxen and J. Buntrock. List of record machines, Available at: \n                  http:\/\/www.drb.insel.de\/\u223cheiner\/BB\/bb-list\n                  \n                ."},{"key":"12_CR11_12","first-page":"274","volume":"40","author":"H. Marxen","year":"1990","unstructured":"H. Marxen and J. Buntrock. Attacking the Busy Beaver 5, Bulletin of the European Association for Theoretical Computer Science (EATCS), 40 (1990), 274-251.","journal-title":"Bulletin of the European Association for Theoretical Computer Science (EATCS)"},{"key":"12_CR12_12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01409968","volume":"32","author":"P. Michel","year":"1993","unstructured":"P. Michel. Busy beaver competition and Collatz-like problems, Arch. Math. Logic, 32 (1993), 351-367.","journal-title":"Arch. Math. Logic"},{"key":"12_CR13_12","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1002\/j.1538-7305.1962.tb00480.x","volume":"41","author":"T. Rado","year":"1962","unstructured":"T. Rado. On non-computable functions, The Bell System Technical Journal, 41 (1962),877-884.","journal-title":"The Bell System Technical Journal"},{"key":"12_CR14_12","first-page":"75","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"T. Rado","year":"1962","unstructured":"T. Rado. On a simple source for non-computable functions, Proceedings of the Symposium on Mathematical Theory of Automata (New York, 1962), volume XII of Microwave Research Institute Symposia Series, Polytechnic Press of the Polytechnic Institute of Brooklyn, 1963, 75-81."},{"key":"12_CR15_12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-642-80732-9_7","volume-title":"GI Gesellschaft f\u00fcr Informatik e.V.: 2. Jahrestagung (Karlsruhe, Germany, 1972), Lecture Notes in Economics and Mathematical Systems","author":"B. Weimann","year":"1973","unstructured":"B. Weimann, K. Casper and W. Fenzl. Untersuchungen \u00fcber haltende Programme f\u00fcr Turingmaschinen mit 2 Zeichen und bis zu 5 Befehlen, GI Gesellschaft f\u00fcr Informatik e.V.: 2. Jahrestagung (Karlsruhe, Germany, 1972), Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 1973, 72-81."}],"container-title":["Studies in Computational Intelligence","Recent Advances in Formal Languages and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-33461-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:01:35Z","timestamp":1620014495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-33461-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540334606","9783540334613"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-33461-3_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2006]]}}}