{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:28:29Z","timestamp":1743100109262,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"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-319-58741-7_22","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"221-233","source":"Crossref","is-referenced-by-count":0,"title":["Infinite Time Busy Beavers"],"prefix":"10.1007","author":[{"given":"Oscar","family":"Defrain","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Durand","sequence":"additional","affiliation":[]},{"given":"Gr\u00e9gory","family":"Lafitte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"22_CR1","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures: An Approach to Definability Theory","author":"J Barwise","year":"1975","unstructured":"Barwise, J.: Admissible Sets and Structures: An Approach to Definability Theory. Perspectives in Mathematical Logic, vol. 7. Springer, Heidelberg (1975)"},{"issue":"5","key":"22_CR2","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1109\/PGEC.1966.264572","volume":"15","author":"AH Brady","year":"1966","unstructured":"Brady, A.H.: The conjectured highest scoring machines for Rad\u00f3\u2019s \n            $${\\varSigma }(k)$$\n           for the value \n            $$k=4$$\n          . IEEE Trans. Electron. Comput. EC 15(5), 802\u2013803 (1966)","journal-title":"IEEE Trans. Electron. Comput. EC"},{"issue":"162","key":"22_CR3","first-page":"647","volume":"40","author":"AH Brady","year":"1983","unstructured":"Brady, A.H.: The determination of the value of Rad\u00f3\u2019s noncomputable function \n            $${\\varSigma }(k)$$\n           for four-state turing machines. Math. Comput. 40(162), 647\u2013665 (1983)","journal-title":"Math. Comput."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-7091-6597-3_9","volume-title":"The Universal Turing Machine: A Half-Century Survey","author":"AH Brady","year":"1995","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 edn, pp. 237\u2013254. Springer, New York (1995)","edition":"2"},{"key":"22_CR5","unstructured":"Durand, B., Lafitte, G.: A constructive swissknife for infinite time turing machines (2016)"},{"issue":"2","key":"22_CR6","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"JD Hamkins","year":"2000","unstructured":"Hamkins, J.D., Lewis, A.: Infinite time turing machines. J. Symbolic Log. 65(2), 567\u2013604 (2000)","journal-title":"J. Symbolic Log."},{"key":"22_CR7","unstructured":"Lafitte, G., Papazian, C.: The fabric of small turing machines. In: Proceedings of the Third Conference on Computability in Europe Computation and Logic in the Real World, CiE 2007, Siena, Italy, 18\u201323 June 2007, pp. 219\u2013227 (2007)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1002\/j.1538-7305.1962.tb00480.x","volume":"41","author":"T Rad\u00f3","year":"1962","unstructured":"Rad\u00f3, T.: On non-computable functions. Bell Syst. Tech. J. 41(3), 877\u2013884 (1962)","journal-title":"Bell Syst. Tech. J."},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1112\/S0024609399006657","volume":"32","author":"PD Welch","year":"2000","unstructured":"Welch, P.D.: The length of infinite time turing machine computations. Bull. London Math. Soc. 32, 129\u2013136 (2000)","journal-title":"Bull. London Math. Soc."},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.tcs.2008.09.050","volume":"410","author":"PD Welch","year":"2009","unstructured":"Welch, P.D.: Characteristics of discrete transfinite time turing machine models: Halting times, stabilization times, and normal form theorems. Theoret. Comput. Sci. 410, 426\u2013442 (2009)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T09:02:58Z","timestamp":1504170178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}