{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:38:53Z","timestamp":1777516733598,"version":"3.51.4"},"reference-count":18,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2016,12,22]]},"DOI":"10.3233\/com-160054","type":"journal-article","created":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T21:36:54Z","timestamp":1482529014000},"page":"1-21","source":"Crossref","is-referenced-by-count":1,"title":["Closed left-r.e. sets"],"prefix":"10.1177","volume":"6","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[{"name":"Department of Computer Science, National University of Singapore, 13 Computing Drive, Singapore 117417, Singapore. sanjay@comp.nus.edu.sg."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Department of Computer Science, National University of Singapore, 10 Lower Kent Ridge Road, Singapore 119076, Singapore. fstephan@comp.nus.edu.sg."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Teutsch","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National University of Singapore, 13 Computing Drive, Singapore 117417, Singapore. teutsch@comp.nus.edu.sg."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/COM-160054_ref1","unstructured":"C.S.\u00a0Calude, Information and Randomness: An Algorithmic Perspective, 2nd edn, Springer, Berlin, 2002."},{"issue":"2","key":"10.3233\/COM-160054_ref2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0196-8858(87)90010-8","article-title":"Incompleteness theorems for random reals","volume":"8","author":"Chaitin","year":"1987","journal-title":"Advances in Applied Mathematics"},{"key":"10.3233\/COM-160054_ref3","doi-asserted-by":"crossref","unstructured":"R.G.\u00a0Downey and D.\u00a0Hirschfeldt, Algorithmic Randomness and Complexity, Springer, New York, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"10.3233\/COM-160054_ref4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication","volume":"23","author":"Friedberg","year":"1958","journal-title":"The Journal of Symbolic Logic"},{"key":"10.3233\/COM-160054_ref5","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","article-title":"Semirecursive sets and positive reducibility","volume":"131","author":"Jockusch","year":"1968","journal-title":"Transactions of the American Mathematical Society"},{"key":"10.3233\/COM-160054_ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1968-0227009-1","article-title":"On the lattice of recursively enumerable sets","volume":"130","author":"Lachlan","year":"1968","journal-title":"Transactions of the American Mathematical Society"},{"key":"10.3233\/COM-160054_ref7","doi-asserted-by":"crossref","unstructured":"M.\u00a0Li and P.\u00a0Vit\u00e1nyi, An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn, Graduate Texts in Computer Science, Springer, New York, 2008.","DOI":"10.1007\/978-0-387-49820-1"},{"issue":"1","key":"10.3233\/COM-160054_ref8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/2268485","article-title":"Solution of a problem of Tarski","volume":"21","author":"Myhill","year":"1956","journal-title":"The Journal of Symbolic Logic"},{"key":"10.3233\/COM-160054_ref10","doi-asserted-by":"crossref","unstructured":"A.\u00a0Nies, Computability and Randomness, Oxford Univ. Press, New York, 2009.","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"10.3233\/COM-160054_ref11","unstructured":"P.\u00a0Odifreddi, Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, Vol.\u00a0125, North-Holland, Amsterdam, 1989."},{"key":"10.3233\/COM-160054_ref12","unstructured":"P.\u00a0Odifreddi, Classical Recursion Theory, Volume II, Studies in Logic and the Foundations of Mathematics, Vol.\u00a0143, Elsevier, Amsterdam, 1999."},{"key":"10.3233\/COM-160054_ref13","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","article-title":"Recursively enumerable sets of positive integers and their decision problems","volume":"50","author":"Post","year":"1944","journal-title":"Bulletin of the American Mathematical Society"},{"key":"10.3233\/COM-160054_ref14","doi-asserted-by":"crossref","first-page":"162","DOI":"10.2307\/2271653","article-title":"Simplicity of recursively enumerable sets","volume":"32","author":"Robinson","year":"1967","journal-title":"The Journal of Symbolic Logic"},{"key":"10.3233\/COM-160054_ref15","unstructured":"H.\u00a0Rogers Jr., Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge, 1987."},{"issue":"1","key":"10.3233\/COM-160054_ref16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","article-title":"Cohesive sets and recursively enumerable Dedekind cuts","volume":"31","author":"Soare","year":"1969","journal-title":"Pacific Journal of Mathematics"},{"key":"10.3233\/COM-160054_ref17","doi-asserted-by":"crossref","unstructured":"R.I.\u00a0Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"10.3233\/COM-160054_ref18","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.ic.2014.02.002","article-title":"Things that can be made into themselves","volume":"237","author":"Stephan","year":"2014","journal-title":"Information and Computation"},{"issue":"6","key":"10.3233\/COM-160054_ref19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russian Mathematical Surveys"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-160054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:59:50Z","timestamp":1777391990000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-160054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":18,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/com-160054","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}