{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:41:50Z","timestamp":1772444510568,"version":"3.50.1"},"reference-count":11,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":4575,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2001,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0\u2032. This contrasts with a result of Ku\u010dera and Terwijn [5] on sets that are low for the class of Martin-L\u00f6f random reals.<\/jats:p>","DOI":"10.2307\/2695101","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:06:19Z","timestamp":1146938779000},"page":"1199-1205","source":"Crossref","is-referenced-by-count":58,"title":["Computational randomness and lowness"],"prefix":"10.1017","volume":"66","author":[{"given":"Sebastiaan A.","family":"Terwijn","sequence":"first","affiliation":[]},{"given":"Domenico","family":"Zambella","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200010574_ref005","first-page":"1396","volume":"64","author":"Ku\u010dera","year":"1999","journal-title":"Lownessfor the class of random sets"},{"key":"S0022481200010574_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80018-9"},{"key":"S0022481200010574_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0076224"},{"key":"S0022481200010574_ref006","unstructured":"van Lambalgen M. , Random sequences, Ph.D. thesis , University of Amsterdam, 1987."},{"key":"S0022481200010574_ref008","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19680140704"},{"key":"S0022481200010574_ref003","first-page":"81","volume-title":"Logic colloquium '78","author":"Demuth","year":"1979"},{"key":"S0022481200010574_ref010","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760523"},{"key":"S0022481200010574_ref009","volume-title":"Classical recursion theory","author":"Odifreddi","year":"1989"},{"key":"S0022481200010574_ref001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/257\/04023","volume-title":"Computability theory and its applications: Current trends and open problems","volume":"257","author":"Ambos-Spies","year":"2000"},{"key":"S0022481200010574_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0112458"},{"key":"S0022481200010574_ref002","first-page":"1","volume-title":"Complexity, logic, and recursion theory","author":"Ambos-Spies","year":"1997"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200010574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T23:26:52Z","timestamp":1557271612000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200010574\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0022481200010574"],"URL":"https:\/\/doi.org\/10.2307\/2695101","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}