{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T02:16:50Z","timestamp":1712715410274},"reference-count":55,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)00014-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"37-70","source":"Crossref","is-referenced-by-count":25,"title":["Computational depth and reducibility"],"prefix":"10.1016","volume":"132","author":[{"given":"David W.","family":"Juedes","sequence":"first","affiliation":[]},{"given":"James I.","family":"Lathrop","sequence":"additional","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00014-X_bib1","series-title":"Technical Report MIT\/LCS\/79\/TM-131","article-title":"Time, space, and randomness","author":"Adleman","year":"1979"},{"key":"10.1016\/0304-3975(94)00014-X_bib2","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(94)00014-X_bib3","first-page":"1251","article-title":"Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set","volume":"9","author":"Barzdin'","year":"1968","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib4","first-page":"297","article-title":"Dissipation, information, computational complexity and the definition of organization","author":"Bennett","year":"1985","journal-title":"Emerging Syntheses in Science, Proceedings of the Founding Workshops of the Santa Fe Institute"},{"key":"10.1016\/0304-3975(94)00014-X_bib5","series-title":"The Universal Turing Machine: A Half-Century Survey","first-page":"227","article-title":"Logical depth and physical complexity","author":"Bennett","year":"1988"},{"key":"10.1016\/0304-3975(94)00014-X_bib6","series-title":"Probability and Measure","author":"Billingsley","year":"1986"},{"key":"10.1016\/0304-3975(94)00014-X_bib7","doi-asserted-by":"crossref","unstructured":"R.V. Book, On languages reducible to algorithmically random languages, SIAM. J. Comput., to appear.","DOI":"10.1137\/S0097539793238140"},{"key":"10.1016\/0304-3975(94)00014-X_bib8","doi-asserted-by":"crossref","unstructured":"R.V. Book, J.H. Lutz and K.W. Wagner, An observation on probability versus randomness with applications to complexity classes. Math. Systems Theory, to appear.","DOI":"10.1007\/BF01578842"},{"key":"10.1016\/0304-3975(94)00014-X_bib9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)00014-X_bib10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences: statistical considerations","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)00014-X_bib11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A theory of program size formally identical to information theory","volume":"22","author":"Chaitin","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)00014-X_bib12","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":"Adv. in Appl. Math."},{"key":"10.1016\/0304-3975(94)00014-X_bib13","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/0304-3975(94)00014-X_bib14","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01084088","article-title":"Families of recursive predicates of measure zero","volume":"6","author":"Freidzon","year":"1976","journal-title":"J. Soviet Math."},{"key":"10.1016\/0304-3975(94)00014-X_bib15","first-page":"1477","article-title":"On the symmetry of algorithmic information","volume":"15","author":"G\u00e1cs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib16","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(86)80004-3","article-title":"Every sequence is reducible to a random one","volume":"70","author":"G\u00e1cs","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00014-X_bib17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00014-X_bib18","series-title":"Measure Theory","author":"Halmos","year":"1950"},{"key":"10.1016\/0304-3975(94)00014-X_bib19","series-title":"Introduction to Automata Theory Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(94)00014-X_bib20","series-title":"General Topology","author":"Kelley","year":"1955"},{"key":"10.1016\/0304-3975(94)00014-X_bib21","first-page":"1","article-title":"Three approaches to the quantitative definition of \u2018information\u2019","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0304-3975(94)00014-X_bib22","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","article-title":"Logical basis for information theory and probability theory","volume":"IT-14","author":"Kolmogorov","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00014-X_bib23","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1137\/1132060","article-title":"Algorithms and randomness","volume":"32","author":"Kolmogorov","year":"1987","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0304-3975(94)00014-X_bib24","first-page":"1087","article-title":"Complexity, depth, and sophistication","volume":"1","author":"Koppel","year":"1987","journal-title":"Complex Systems"},{"key":"10.1016\/0304-3975(94)00014-X_bib25","first-page":"435","article-title":"Structure","author":"Koppel","year":"1988"},{"key":"10.1016\/0304-3975(94)00014-X_bib26","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib27","first-page":"206","article-title":"Laws of information conservation (nongrowth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0304-3975(94)00014-X_bib28","first-page":"601","article-title":"On the principle of conservation of information in intuitionistic mathematics","volume":"17","author":"Levin","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib29","first-page":"337","article-title":"Uniform tests of randomness","volume":"17","author":"Levin","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib30","first-page":"522","article-title":"Various measures of complexity for finite objects (axiomatic description)","volume":"17","author":"Levin","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib31","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","article-title":"Randomness conservation inequalities; information and independence in mathematical theories","volume":"61","author":"Levin","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00014-X_bib32","first-page":"359","article-title":"Invariant properties of informational bulks","author":"Levin","year":"1977","journal-title":"Proceedings of the Sixth Symposium on Mathematical Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)00014-X_bib33","series-title":"Handbook of Theoretical Computer Science, Vol. A","first-page":"187","article-title":"Kolmogorov complexity and its applications","author":"Li","year":"1990"},{"key":"10.1016\/0304-3975(94)00014-X_bib34","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1137\/0220056","article-title":"Learning simple concepts under simple distributions","volume":"20","author":"Li","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00014-X_bib35","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/0304-3975(94)00014-X_bib36","unstructured":"J.H. Lutz, Resource-bounded measure, in preparation."},{"key":"10.1016\/0304-3975(94)00014-X_bib37","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00014-X_bib38","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","article-title":"Classes of recursively enumerable sets and degrees of unsolvability","volume":"12","author":"Martin","year":"1966","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(94)00014-X_bib39","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"On the definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00014-X_bib40","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00534110","article-title":"Complexity oscillations in infinite binary sequences","volume":"19","author":"Martin-L\u00f6f","year":"1971","journal-title":"Seitschrift f\u00fcr Wahrscheinlichkeits-theory and Verwandte Gebiete"},{"key":"10.1016\/0304-3975(94)00014-X_bib41","series-title":"Proceedings of the Second Colloquium on Automata, Languages and Programming","first-page":"317","article-title":"The \u201calmost all\u201d theory of subrecursive degrees is decidable","volume":"Vol. 14","author":"Mehlhorn","year":"1974"},{"key":"10.1016\/0304-3975(94)00014-X_bib42","series-title":"Descriptive Set Theory","author":"Moschovakis","year":"1980"},{"key":"10.1016\/0304-3975(94)00014-X_bib43","series-title":"Measure and Category","author":"Oxtoby","year":"1980"},{"key":"10.1016\/0304-3975(94)00014-X_bib44","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(94)00014-X_bib45","series-title":"Real Analysis","author":"Royden","year":"1988"},{"key":"10.1016\/0304-3975(94)00014-X_bib46","series-title":"Degrees of Unsolvability","author":"Sacks","year":"1966"},{"key":"10.1016\/0304-3975(94)00014-X_bib47","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00014-X_bib48","first-page":"14","article-title":"The frequency approach to defining a random sequence","volume":"19","author":"Shen'","year":"1982","journal-title":"Semiotika i Informatika"},{"key":"10.1016\/0304-3975(94)00014-X_bib49","first-page":"316","article-title":"On relations between different algorithmic definitions of randomness","volume":"38","author":"Shen'","year":"1989","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib50","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/0304-3975(94)00014-X_bib51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00014-X_bib52","unstructured":"R.M. Solovay, 1975, reported in [12]."},{"key":"10.1016\/0304-3975(94)00014-X_bib53","first-page":"1090","article-title":"On Turing invariant sets","volume":"17","author":"V'jugin","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(94)00014-X_bib54","first-page":"147","article-title":"The algebra of invariant properties of finite sequences","volume":"18","author":"V'jugin","year":"1982","journal-title":"Problems of Inform. Transmission"},{"key":"10.1016\/0304-3975(94)00014-X_bib55","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 Math. Surveys"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400014X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400014X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:59:04Z","timestamp":1555077544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400014X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":55,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["030439759400014X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00014-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}