{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:02Z","timestamp":1725664982998},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631651"},{"type":"electronic","value":"9783540691945"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_171","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:10:12Z","timestamp":1330297812000},"page":"132-142","source":"Crossref","is-referenced-by-count":0,"title":["Recursive computational depth"],"prefix":"10.1007","author":[{"given":"James I.","family":"Lathrop","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"13_CR1","volume-title":"Talk by K. Ambos-Spies at the Workshop on Information and Randomness in Complexity Classes","author":"K. Ambos-Spies","year":"1996","unstructured":"K. Ambos-Spies and Y. Wang. Algorithmic randomness concepts: a comparison. Talk by K. Ambos-Spies at the Workshop on Information and Randomness in Complexity Classes, Schloss Dagstuhl, Germany, July 17, 1996."},{"key":"13_CR2","unstructured":"C. H. Bennett. Dissipation, information, computational complexity and the definition of organization. In D. Pines, editor, Emerging Syntheses in Science, Proceedings of the Founding Workshops of the Santa Fe Institute, pages 297\u2013313, 1985."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"C. H. Bennett. Logical depth and physical complexity. In R. Herken, editor, The Universal Turing Machine: A Half-Century Survey, pages 227\u2013257. Oxford University Press, 1988.","DOI":"10.1093\/oso\/9780198537748.003.0008"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"S. A. Fenner, J. H. Lutz, and E. Mayordomo. Weakly useful sequences. In Proceedings of the 22 nd International Colloquium on Automata, Languages, and Programming, pages 393\u2013404. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60084-1_91"},{"key":"13_CR5","unstructured":"W. I. Gasarch and J. H. Lutz. Unpublished manuscript, 1991."},{"key":"13_CR6","unstructured":"D. W. Juedes. The Complexity and Distribution of Computationally Useful Problems. PhD thesis, Department of Computer Science, Iowa State University, 1994."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(94)00014-X","volume":"132","author":"D. W. Juedes","year":"1994","unstructured":"D. W. Juedes, J. I. Lathrop, and J. H. Lutz. Computational depth and reducibility. Theoretical Computer Science, 132:37\u201370, 1994.","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","unstructured":"J. I. Lathrop. Compression depth and the behavior of cellular automata. Complex Systems, 1997. To appear."},{"key":"13_CR9","doi-asserted-by":"crossref","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":"13_CR10","doi-asserted-by":"crossref","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. On the definition of random sequences. Information and Control, 9:602\u2013619, 1966.","journal-title":"Information and Control"},{"key":"13_CR11","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":"13_CR12","doi-asserted-by":"crossref","unstructured":"C. P. Schnorr. Zuf\u00e4lligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, 218, 1971.","DOI":"10.1007\/BFb0112458"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. J. Solomonoff","year":"1964","unstructured":"R. J. Solomonoff. A formal theory of inductive inference. Information and Control, 7:1\u201322, 224\u2013254, 1964.","journal-title":"Information and Control"},{"key":"13_CR14","unstructured":"M. van Lambalgen. Random Sequences. PhD thesis, Department of Mathematics, University of Amsterdam, 1987."},{"key":"13_CR15","unstructured":"Y. Wang. Randomness and Complexity. PhD thesis, Department of Mathematics, University of Heidelberg, 1996."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_171.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:06:28Z","timestamp":1713636388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_171","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}