{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T11:25:35Z","timestamp":1751887535226},"reference-count":36,"publisher":"Wiley","issue":"13-14","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":10543,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1978,1]]},"DOI":"10.1002\/malq.19780241303","type":"journal-article","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T21:53:29Z","timestamp":1180389209000},"page":"207-224","source":"Crossref","is-referenced-by-count":8,"title":["On the Simplicity of Busy Beaver Sets"],"prefix":"10.1002","volume":"24","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Bennison V. On the computational complexity of recursively enumerable sets. Ph. D. Dissertation. Univ. of Chicago1976."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321395"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90546-3"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/321637.321648"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.2307\/2271984"},{"key":"e_1_2_1_7_2","unstructured":"Brady A. Solution of the non\u2010computable \u2018Busy Beaver\u2019 game for k = 4. Abstracts for ACM Computer Science Conference Washington D.C. 1975 p.27."},{"key":"e_1_2_1_8_2","unstructured":"Case J. Enumeration maximal recursively enumerable sets. Technical Report #67 Computer Science Department SUNY at Buffalo1973."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/2272040"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90015-9"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02219729"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1958-035-x"},{"key":"e_1_2_1_13_2","volume-title":"A primer of ALGOL 60 programming","author":"Dijkstra E.","year":"1962"},{"key":"e_1_2_1_14_2","unstructured":"van Emde Boas P. Abstract resource\u2010bound classes. Ph. D. Dissertation Mathematisch Centrum Amsterdam1974."},{"key":"e_1_2_1_15_2","first-page":"31","article-title":"Three theorems on recursive enumeration","volume":"23","author":"Friedberg R.","year":"1958","journal-title":"J. Symb. Log."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.2307\/2272852"},{"key":"e_1_2_1_17_2","first-page":"31","article-title":"An overview of the theory of computational complexity","volume":"18","author":"Hartmanis J.","year":"1972","journal-title":"JACM"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.2307\/2271359"},{"key":"e_1_2_1_19_2","first-page":"31","article-title":"The priority method I","volume":"13","author":"Lachlan A.","year":"1967","journal-title":"This Zeitschr."},{"key":"e_1_2_1_20_2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1090\/S0002-9947-1968-0227009-1","article-title":"On the lattice of recursively enumerable sets","volume":"130","author":"Lachlan A.","year":"1968","journal-title":"Trans. AMS"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.2307\/2272056"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321702"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/321264.321270"},{"key":"e_1_2_1_24_2","doi-asserted-by":"crossref","unstructured":"McCreight E. Classes of computable functions defined by bounds on computation. Ph. D. Dissertation Carnegie\u2010Mellon University 1969.","DOI":"10.1145\/800169.805423"},{"key":"e_1_2_1_25_2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1215\/ijm\/1256054664","article-title":"Some remarks on extensibility, confluence of paths, branching properties, and index sets for certain recursively enumerable graphs","volume":"11","author":"McLaughlin T.","year":"1967","journal-title":"Illinois J. Math."},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.485"},{"key":"e_1_2_1_27_2","first-page":"31","article-title":"Classes of recursively enumerable sets and degrees of unsolvability","volume":"12","author":"Martin D.","year":"1966","journal-title":"This Zeitschr."},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1944-08111-1"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1962.tb00480.x"},{"key":"e_1_2_1_30_2","unstructured":"Rado T. On a simple source for non\u2010computable functions. Proc. of Symposium on Mathematical Theory of Automata Polytechnic Institute of Brooklyn1962 pp.75\u201381."},{"key":"e_1_2_1_31_2","volume-title":"Theory of recursive functions and effective computability","author":"Rogers H.","year":"1967"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.2307\/1970842"},{"key":"e_1_2_1_33_2","unstructured":"Soare R. Computational complexity speedable and levelable sets. Preprint."},{"key":"e_1_2_1_34_2","unstructured":"Tennebaum S. Degrees of unsolvability and the rate of growth of functions. Notices AMS1961 #578\u2013128."},{"key":"e_1_2_1_35_2","first-page":"31","article-title":"On autoreducibility","volume":"11","author":"Trahtenbrot B.","year":"1970","journal-title":"Soviet Math. Doklady"},{"key":"e_1_2_1_36_2","first-page":"31","article-title":"Recursively enumerable sets and retracing functions","volume":"8","author":"Yates C.","year":"1962","journal-title":"This Zeitschr."},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.2307\/2270621"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19780241303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19780241303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T11:07:01Z","timestamp":1693480021000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19780241303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":36,"journal-issue":{"issue":"13-14","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["10.1002\/malq.19780241303"],"URL":"https:\/\/doi.org\/10.1002\/malq.19780241303","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}