{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:57Z","timestamp":1725565917023},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_82","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"983-995","source":"Crossref","is-referenced-by-count":0,"title":["Some Results on Effective Randomness"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Merkle","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mihailovi\u0107","sequence":"additional","affiliation":[]},{"given":"Theodore A.","family":"Slaman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"82_CR1","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Computability Theory and Its Applications. Current Trends and Open Problems","author":"K. Ambos-Spies","year":"2000","unstructured":"Ambos-Spies, K., Ku\u010dera, A.: Randomness in computability theory. In: Cholak, P.A., et al. (eds.) Computability Theory and Its Applications. Current Trends and Open Problems. Contemporary Mathematics, vol.\u00a0257, pp. 1\u201314. American Mathematical Society (AMS), Providence (2000)"},{"key":"82_CR2","first-page":"1","volume-title":"Complexity, Logic, and Recursion Theory","author":"K. Ambos-Spies","year":"1997","unstructured":"Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Complexity, Logic, and Recursion Theory, pp. 1\u201347. Dekker, New York (1997)"},{"key":"82_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J.L. Balc\u00e1zar","year":"1995","unstructured":"Balc\u00e1zar, J.L., D\u00b4\u0131az, J., Gabarr\u00f3, J.: Structural Complexity I. Springer, Heidelberg (1995)"},{"key":"82_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03049-3","volume-title":"Information and Randomness","author":"C.S. Calude","year":"1994","unstructured":"Calude, C.S.: Information and Randomness. Springer, Heidelberg (1994)"},{"key":"82_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00027-5","volume":"271","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: A characterization of c.e. random reals. Theoretical Computer Science\u00a0271, 3\u201314 (2002)","journal-title":"Theoretical Computer Science"},{"key":"82_CR6","volume-title":"Essentials of Stochastic Process","author":"R. Durrett","year":"1999","unstructured":"Durrett, R.: Essentials of Stochastic Process. Springer, Heidelberg (1999)"},{"key":"82_CR7","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity (2003) (manuscript)"},{"key":"82_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45465-9_47","volume-title":"Automata, Languages and Programming","author":"J.M. Hitchcock","year":"2002","unstructured":"Hitchcock, J.M., Lutz, J.H.: Why computational complexity requires stricter martingales. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 549\u2013560. Springer, Heidelberg (2002)"},{"key":"82_CR9","doi-asserted-by":"crossref","unstructured":"Hitchcock, J.M.: Small Spans in Scaled Dimension. In: IEEE Conference on Computational Complexity (2004) (to appear)","DOI":"10.1109\/CCC.2004.1313811"},{"key":"82_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-61723-X_989","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"A. Ku\u010dera","year":"1996","unstructured":"Ku\u010dera, A.: Measure, \n                    \n                      \n                    \n                    $\\rm \\Pi^{0}_{1}$\n                   -classes and complete extensions of PA. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol.\u00a01141, pp. 245\u2013259. Springer, Heidelberg (1996)"},{"key":"82_CR11","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0049-237X(08)70130-7","volume-title":"Logic Colloquium 1987","author":"A. Ku\u010dera","year":"1989","unstructured":"Ku\u010dera, A.: On the use of diagonally nonrecursive functions. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium 1987. Studies in Logic and the Foundations of Mathematics, vol.\u00a0129, pp. 219\u2013239. North-Holland, Amsterdam (1989)"},{"issue":"1","key":"82_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A. Ku\u010dera","year":"2001","unstructured":"Ku\u010dera, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM Journal on Computing\u00a031(1), 199\u2013211 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"82_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"82_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":"Lutz, J.H.: Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences\u00a044, 220\u2013258 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"82_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-1-4612-1872-2_10","volume-title":"Complexity Theory Retrospective II","author":"J.H. Lutz","year":"1997","unstructured":"Lutz, J.H.: The quantitative structure of exponential time. In: Hemaspaandra, L.A., Selman, A.L. (eds.) Complexity Theory Retrospective II, pp. 225\u2013260. Springer, Heidelberg (1997)"},{"issue":"6","key":"82_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":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09(6), 602\u2013619 (1966)","journal-title":"Information and Control"},{"key":"82_CR17","unstructured":"Mayordomo, E.: Contributions to the Study of Resource-Bounded Measure. Doctoral dissertation, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain (1994)"},{"key":"82_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00069-3","volume":"207","author":"A.A. Muchnik","year":"1990","unstructured":"Muchnik, A.A., Semenov, A.L., Uspensky, V.A.: Mathematical metaphysics of randomness. Theoretical Computer Science\u00a0207, 263\u2013317 (1990)","journal-title":"Theoretical Computer Science"},{"key":"82_CR19","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)"},{"key":"82_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/BF01694181","volume":"5","author":"C.-P. Schnorr","year":"1971","unstructured":"Schnorr, C.-P.: A unified approach to the definition of random sequences. Mathematical Systems Theory\u00a05, 246\u2013258 (1971)","journal-title":"Mathematical Systems Theory"},{"key":"82_CR21","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0112459","volume-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","author":"C.-P. Schnorr","year":"1971","unstructured":"Schnorr, C.-P.: Zuf\u00e4lligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, vol.\u00a0218. Springer, Heidelberg (1971)"},{"key":"82_CR22","doi-asserted-by":"crossref","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, Heidelberg (1987)"},{"key":"82_CR23","unstructured":"Solovay, R.M.: Draft of a Paper (or Series of Papers) on Chaitin\u2019s Work...Manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY (1974)"},{"key":"82_CR24","unstructured":"Terwijn, S.A.: Computability and Measure. Doctoral dissertation, Universiteit van Amsterdam, Amsterdam, Netherlands (1998)"},{"key":"82_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0020-0190(98)00202-6","volume":"69","author":"Y. Wang","year":"1999","unstructured":"Wang, Y.: A Separation of two randomness concepts. Information Processing Letters\u00a069, 115\u2013118 (1999)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:31:09Z","timestamp":1620012669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}