{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:38:07Z","timestamp":1743007087592,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_47","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"568-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Construction of Effective Random Sets"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Merkle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Mihailovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies and A. Ku\u010dera. Randomness in computability theory. In P. A. Cholak et al. (eds.), Computability Theory and Its Applications. Current Trends and Open Problems. Contemporary Mathematics 257:1\u201314, American Mathematical Society (AMS), 2000.","DOI":"10.1090\/conm\/257\/04023"},{"key":"47_CR2","first-page":"1","volume-title":"Complexity, Logic, and Recursion Theory","author":"K. Ambos-Spies","year":"1997","unstructured":"K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In A. Sorbi (ed.), Complexity, Logic, and Recursion Theory, p. 1\u201347. Dekker, New York, 1997."},{"key":"47_CR3","unstructured":"T. M. Apostol. Mathematical Analysis, third edition. Addison Wesley, 1978."},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity I, Springer, 1995.","DOI":"10.1007\/978-3-642-79235-9"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"C. Calude, Information and Randomness, Springer-Verlag, 1994.","DOI":"10.1007\/978-3-662-03049-3"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00027-5","volume":"271","author":"C. S. Calude","year":"2002","unstructured":"C. S. Calude. A characterization of c.e. random reals. Theoretical Computer Science 271:3\u201314, 2002.","journal-title":"Theoretical Computer Science"},{"key":"47_CR7","unstructured":"T. Ebert. Applications of Recursive Operators to Randomness and Complexity. Ph.D. Thesis, University of California at Santa Barbara, 1998."},{"key":"47_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44612-5_29","volume-title":"Mathematical Foundations of Computer Science 2000","author":"T. Ebert","year":"2000","unstructured":"T. Ebert and H. Vollmer. On the autoreducibility of random sequences. In: M. Nielsen and B. Rovan (eds.), Mathematical Foundations of Computer Science 2000, Lecture Notes in Computer Science 1893:333\u2013342, Springer, 2000."},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"T. Ebert and W. Merkle. Autoreducibility of random sets: a sharp bound on the density of guessed bits. Mathematical Foundations of Computer Science 2002, this volume.","DOI":"10.1007\/3-540-45687-2_18"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(86)80004-3","volume":"70","author":"P. G\u00e1cs","year":"1986","unstructured":"P. G\u00e1cs. Every sequence is reducible to a random one. Information and Control 70:186\u2013192, 1986.","journal-title":"Information and Control"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera. Measure, \u03a001-classes and complete extensions of PA. In: H.-D. Ebbinghaus et al. (eds.), Recursion Theory Week. Lecture Notes in Mathematics 1141:245\u2013259, Springer, 1985.","DOI":"10.1007\/BFb0076224"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera. On the use of diagonally nonrecursive functions. In: H.-D. Ebbinghaus et al. (eds.), Logic Colloquium\u2019 87. Studies in Logic and the Foundations of Mathematics 129:219\u2013239, North-Holland, 1989.","DOI":"10.1016\/S0049-237X(08)70130-7"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and Its Applications, second edition. Springer, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J. H. Lutz","year":"1992","unstructured":"J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220\u2013258, 1992.","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra and A. L. Selman (eds.), Complexity Theory Retrospective II, p. 225\u2013260, Springer, 1997.","DOI":"10.1007\/978-1-4612-1872-2_10"},{"issue":"6","key":"47_CR16","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"P. Martin-L\u00f6f. The definition of random sequences. Information and Control 9(6):602\u2013619, 1966.","journal-title":"Information and Control"},{"key":"47_CR17","series-title":"Doctoral dissertation","volume-title":"Contributions to the Study of Resource-Bounded Measure","author":"E. Mayordomo","year":"1994","unstructured":"E. Mayordomo. Contributions to the Study of Resource-Bounded Measure. Doctoral dissertation, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain, 1994."},{"key":"47_CR18","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"47_CR19","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/BF01694181","volume":"5","author":"C.-P. Schnorr","year":"1971","unstructured":"C.-P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory, 5:246\u2013258, 1971.","journal-title":"Mathematical Systems Theory"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"C.-P. Schnorr. Zuf\u00e4lligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics 218, Springer, 1971.","DOI":"10.1007\/BFb0112458"},{"key":"47_CR21","doi-asserted-by":"crossref","unstructured":"R. I. Soare. Recursively Enumerable Sets and Degrees. Springer, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"47_CR22","series-title":"Doctoral dissertation","volume-title":"Computability and Measure","author":"S. A. Terwijn","year":"1998","unstructured":"S. A. Terwijn. Computability and Measure. Doctoral dissertation, Universiteit van Amsterdam, Amsterdam, Netherlands, 1998."},{"key":"47_CR23","first-page":"814","volume":"11","author":"B. A. Trakhtenbrot","year":"1970","unstructured":"B. A. Trakhtenbrot, On autoreducibility. Soviet Math. Doklady, 11:814\u2013817, 1970.","journal-title":"Soviet Math. Doklady"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T21:19:07Z","timestamp":1674163147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}