{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:00Z","timestamp":1725890340848},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_10","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:03:34Z","timestamp":1341810214000},"page":"130-140","source":"Crossref","is-referenced-by-count":1,"title":["Randomness Behaviour in Blum Universal Static Complexity Spaces"],"prefix":"10.1007","author":[{"given":"Cezar","family":"C\u00e2mpeanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Bienvenu, L., Downey, R.: Kolmogorov Complexity and Solovay Functions. In: Symposium on Theoretical Aspects of Computer Science, Freiburg, pp. 147\u2013158 (2009)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM\u00a014(2), 322\u2013336 (1967)","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","volume":"11","author":"M. Blum","year":"1967","unstructured":"Blum, M.: On the size of machines. Information and Control\u00a011, 257\u2013265 (1967)","journal-title":"Information and Control"},{"key":"10_CR4","first-page":"21","volume":"4","author":"M. Burgin","year":"1990","unstructured":"Burgin, M.: Generalized Kolmogorov complexity and other dual complexity measures. Translated from Kibernetica\u00a04, 21\u201329 (1990); Original article submitted June 19 (1986)","journal-title":"Translated from Kibernetica"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2003.12.003","volume":"317","author":"M. Burgin","year":"2004","unstructured":"Burgin, M.: Algorithmic complexity of recursive and inductive algorithms. Theoretical Computer Science\u00a0317, 31\u201360 (2004)","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.tcs.2007.04.011","volume":"383","author":"M. Burgin","year":"2007","unstructured":"Burgin, M.: Algorithmic complexity as a criterion of unsolvability. Theoretical Computer Science\u00a0383, 244\u2013259 (2007)","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03049-3","volume-title":"Information and Randomness - An Algorithmic Perspective","author":"C. Calude","year":"1994","unstructured":"Calude, C.: Information and Randomness - An Algorithmic Perspective. Springer, Berlin (1994)"},{"key":"10_CR8","volume-title":"Theories of Computational Complexity","author":"C. Calude","year":"1988","unstructured":"Calude, C.: Theories of Computational Complexity. North-Holland, Amsterdam (1988)"},{"key":"10_CR9","unstructured":"Calude, C., Salomaa, K., Roblot, T.K.: Finite State Complexity and Randomness. Technical Report CDMTCS 374 (December 2009) (revised June 2010)"},{"key":"10_CR10","unstructured":"C\u00e2mpeanu, C.: Private Communication to Helmut Jurgensen and Cristian Calude at first edition of DCAGRS (1999)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-27654-5_6","volume-title":"Computation, Physics and Beyond","author":"C. C\u00e2mpeanu","year":"2012","unstructured":"C\u00e2mpeanu, C.: A Note on Blum Static Complexity Measures. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) Computation, Physics and Beyond. LNCS, vol.\u00a07160, pp. 71\u201380. Springer, Heidelberg (2012)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G.J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.: On the Length of Programs for Computing Finite Binary Sequences. J. ACM\u00a013(4), 547\u2013569 (1966)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/321495.321506","volume":"16","author":"G.J. Chaitin","year":"1969","unstructured":"Chaitin, G.J.: On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. J. ACM\u00a016(1), 145\u2013159 (1969)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A Theory of Program Size Formally Identical to Information Theory. J. ACM\u00a022(3), 329\u2013340 (1975)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A Theory of Program Size Formally Identical to Information Theory. J. ACM\u00a022(3), 329\u2013340 (1975)","journal-title":"J. ACM"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Algorithmic Information Theory. Cambridge Tracts in Theoretical Computer Science, vol.\u00a0I. Cambridge University Press (1987)","DOI":"10.1017\/CBO9780511608858"},{"key":"10_CR17","volume-title":"Computability, Complexity, and Languages","author":"M. Davis","year":"1994","unstructured":"Davis, M., Sigal, R., Weyuker, E.: Computability, Complexity, and Languages, 1st edn. Academic Press, New York (1994)","edition":"1"},{"key":"10_CR18","first-page":"1477","volume":"15","author":"P. Gacs","year":"1974","unstructured":"Gacs, P.: On the symmetry of algorithmic information. Soviet Mathematics Doklady\u00a015, 1477\u20131480 (1974)","journal-title":"Soviet Mathematics Doklady"},{"key":"10_CR19","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Problems Inform. Transmission\u00a01, 1\u20137 (1965)","journal-title":"Transmission"},{"issue":"3","key":"10_CR20","first-page":"206","volume":"10","author":"L.A. Levin","year":"1974","unstructured":"Levin, L.A.: Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Problems of Information Transmission\u00a010(3), 206\u2013210 (1974)","journal-title":"Problems of Information Transmission"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Loveland, D.A.: On Minimal-Program Complexity Measures. In: STOC, pp. 61\u201365 (1969)","DOI":"10.1145\/800169.805422"},{"key":"10_CR22","volume-title":"Elements of the theory of computation","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Lewis, H.: Elements of the theory of computation. Prentice-Hall, Englewood Cliffs (1982); 2nd edn. (September 1997)"},{"issue":"4","key":"10_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C.-P. Schnorr","year":"1973","unstructured":"Schnorr, C.-P.: Process complexity and effective random tests. Journal of Computer and System Sciences\u00a07(4), 376\u2013388 (1973)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A Formal Theory of Inductive Inference, Part I. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A Formal Theory of Inductive Inference, Part II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"IT-24","author":"R.J. Solomonoff","year":"1978","unstructured":"Solomonoff, R.J.: Complexity-Based Induction Systems: Comparisons and Convergence Theorems. IEEE Trans. on Information Theory\u00a0IT-24(4), 422\u2013432 (1978)","journal-title":"IEEE Trans. on Information Theory"},{"key":"10_CR27","unstructured":"Solovay, R.M.: Draft of paper (or series of papers) on Chaitin\u2019s work. Unpublished notes, pp. 1\u2013215 (May 1975)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31623-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:33Z","timestamp":1620128433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}