{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:24:17Z","timestamp":1725582257951},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_23","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"218-229","source":"Crossref","is-referenced-by-count":2,"title":["Closed Left-R.E. Sets"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]},{"given":"Jason","family":"Teutsch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0196-8858(87)90010-8","volume":"8","author":"G.J. Chaitin","year":"1987","unstructured":"Chaitin, G.J.: Incompleteness theorems for random reals. Advances in Applied Mathematics\u00a08(2), 119\u2013146 (1987)","journal-title":"Advances in Applied Mathematics"},{"key":"23_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R. Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, New York (2010)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R.M. Friedberg","year":"1958","unstructured":"Friedberg, R.M.: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. The Journal of Symbolic Logic\u00a023, 309\u2013316 (1958)","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1968-0227009-1","volume":"130","author":"A.H. Lachlan","year":"1968","unstructured":"Lachlan, A.H.: On the lattice of recursively enumerable sets. Transactions of American Mathematical Society\u00a0130, 1\u201337 (1968)","journal-title":"Transactions of American Mathematical Society"},{"key":"23_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer, New York (2008)","edition":"3"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/2268485","volume":"21","author":"J. Myhill","year":"1956","unstructured":"Myhill, J.: Solution of a problem of Tarski. The Journal of Symbolic Logic\u00a021(1), 49\u201351 (1956)","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and randomness","author":"A. Nies","year":"2009","unstructured":"Nies, A.: Computability and randomness. Oxford University Press, New York (2009)"},{"key":"23_CR8","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical recursion theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0125. North-Holland, Amsterdam (1989)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E. Post","year":"1944","unstructured":"Post, E.: Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society\u00a050, 284\u2013316 (1944)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.2307\/2271653","volume":"32","author":"R.W. Robinson","year":"1967","unstructured":"Robinson, R.W.: Simplicity of recursively enumerable sets. The Journal of Symbolic Logic\u00a032, 162\u2013172 (1967)","journal-title":"The Journal of Symbolic Logic"},{"key":"23_CR11","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1987","unstructured":"Rogers Jr., H.: Theory of recursive functions and effective computability. MIT Press, Cambridge (1987)"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","volume":"31","author":"R.I. Soare","year":"1969","unstructured":"Soare, R.I.: Cohesive sets and recursively enumerable Dedekind cuts. Pacific Journal of Mathematics\u00a031(1), 215\u2013231 (1969)","journal-title":"Pacific Journal of Mathematics"},{"key":"23_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively enumerable sets and degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. Springer, Berlin (1987)"},{"issue":"6","key":"23_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys\u00a025(6), 83 (1970)","journal-title":"Russian Mathematical Surveys"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:10:18Z","timestamp":1558573818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}