{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T17:02:44Z","timestamp":1702400564870},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1975,3,1]],"date-time":"1975-03-01T00:00:00Z","timestamp":162864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1975,3]]},"DOI":"10.1007\/bf01698128","type":"journal-article","created":{"date-parts":[[2005,5,15]],"date-time":"2005-05-15T06:36:11Z","timestamp":1116138971000},"page":"83-94","source":"Crossref","is-referenced-by-count":15,"title":["Minimal-program complexity of pseudo-recursive and pseudo-random sequences"],"prefix":"10.1007","volume":"9","author":[{"given":"R. P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01698128_CR1","first-page":"1251","volume":"9","author":"J. Barzdin","year":"1968","unstructured":"J. Barzdin, Complexity of programs to determine whether natural numbers not greater thann belong to a recursively enumerable set,Soviet Math. Dokl. 9 (1968), 1251\u20131254.","journal-title":"Soviet Math. Dokl."},{"key":"BF01698128_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. Chaitin","year":"1966","unstructured":"G. Chaitin, On the length of programs for computing finite binary sequences,J. Assoc. Comput. Mach. 13 (1966), 547\u2013569.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01698128_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","volume":"16","author":"G. Chaitin","year":"1969","unstructured":"G. Chaitin, On the length of programs for computing finite binary sequences; statistical considerations,J. Assoc. Comput. Mach. 16 (1969), 145\u2013159.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01698128_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","volume":"46","author":"A. Church","year":"1940","unstructured":"A. Church, On the concept of a random sequence,Bull. Amer. Math. Soc. 46 (1940), 130\u2013135.","journal-title":"Bull. Amer. Math. Soc."},{"key":"BF01698128_CR5","unstructured":"R. Daley, Minimal-program complexity of pseudo-recursive and pseudo-random sequences, Carnegie-Mellon, Dept. of Math. Report, 71-28 (1971)."},{"key":"BF01698128_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0019-9958(73)80001-4","volume":"23","author":"R. Daley","year":"1973","unstructured":"R. Daley, Minimal-program complexity of sequences with restricted resources,Information and Control 23 (1973), 301\u2013312.","journal-title":"Information and Control"},{"key":"BF01698128_CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.4153\/CJM-1958-035-x","volume":"10","author":"J. Dekker","year":"1958","unstructured":"J. Dekker andJ. Myhill, Retraceable sets,Canadian J. Math. 10 (1958), 357\u2013373.","journal-title":"Canadian J. Math."},{"key":"BF01698128_CR8","volume-title":"Theories of Probability","author":"T. Fine","year":"1973","unstructured":"T. Fine,Theories of Probability, Academic Press, New York, 1973."},{"key":"BF01698128_CR9","first-page":"3","volume":"1","author":"A. Kolmogorov","year":"1965","unstructured":"A. Kolmogorov, Three approaches for defining the concept of information quantity,Peredachi Informatsii 1 (1965), 3\u201311; Amer. Math. Soc. Transl., Vol. 7, 1968.","journal-title":"Peredachi Informatsii"},{"key":"BF01698128_CR10","doi-asserted-by":"crossref","unstructured":"A. Kolmogorov, Logical basis for information and probability theory,IEEE Trans. Information Theory IT-14 (1968), 662\u2013664.","DOI":"10.1109\/TIT.1968.1054210"},{"key":"BF01698128_CR11","doi-asserted-by":"crossref","unstructured":"D. Loveland, Minimal-program complexity measure, Conference Record ACM Symposium on Theory of Computing, May 1968, pp. 61\u201365.","DOI":"10.1145\/800169.805422"},{"key":"BF01698128_CR12","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","volume":"15","author":"D. Loveland","year":"1969","unstructured":"D. Loveland, A variant of the Kolmogorov concept of complexity,Information and Control 15 (1969), 510\u2013526.","journal-title":"Information and Control"},{"key":"BF01698128_CR13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/malq.19660120124","volume":"12","author":"D. Loveland","year":"1966","unstructured":"D. Loveland, A new interpretation of the von Mises concept of random sequence,Z. Math. Logik 12 (1966), 279\u2013294.","journal-title":"Z. Math. Logik"},{"key":"BF01698128_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","volume":"12","author":"D. Martin","year":"1966","unstructured":"D. Martin, Classes of r.e. sets of degrees of unsolvability,Z. Math. Logik 12 (1966), 295\u2013310.","journal-title":"Z. Math. Logik"},{"key":"BF01698128_CR15","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, The definition of random sequences,Information and Control 9 (1966), 602\u2013619.","journal-title":"Information and Control"},{"key":"BF01698128_CR16","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"BF01698128_CR17","unstructured":"C. Schnorr, Optimal G\u00f6del numberings, Proc. IFIP Congress (1971) Ljubljana, Yugoslavia, TA-2, pp. 12\u201314."},{"key":"BF01698128_CR18","doi-asserted-by":"crossref","unstructured":"C. Schnorr, The process complexity and effective random tests,Proc. ACM Conf. on Theory of Computing (1972), pp. 168\u2013176.","DOI":"10.1145\/800152.804910"},{"key":"BF01698128_CR19","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/BF01694181","volume":"5","author":"C. Schnorr","year":"1971","unstructured":"C. Schnorr, A unified approach to the definition of random sequences,Math. Systems Theory,5 (1971), 246\u2013258.","journal-title":"Math. Systems Theory"},{"key":"BF01698128_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0112458","volume-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","author":"C. Schnorr","year":"1971","unstructured":"C. Schnorr,Zuf\u00e4lligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, No. 218, Springer-Verlag, Berlin, 1971."},{"key":"BF01698128_CR21","volume-title":"\u00c9tude Critique de la Notion de Collectif","author":"J. Ville","year":"1939","unstructured":"J. Ville,\u00c9tude Critique de la Notion de Collectif, Gauthiers-Villars, Paris, 1939."},{"key":"BF01698128_CR22","doi-asserted-by":"crossref","first-page":"114","DOI":"10.2307\/2037498","volume":"23","author":"V. Vuckovic","year":"1969","unstructured":"V. Vuckovic, Almost recursive sets,Proc. Amer. Math. Soc. 23 (1969), 114\u2013119.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF01698128_CR23","first-page":"85","volume":"156","author":"A. Zvonkin","year":"1970","unstructured":"A. Zvonkin andL. Levin, Complexity of finite objects and foundations of the notion of information and randomness with the aid of the theory of algorithms (Russian),Uspekhi Mat. Nauk 156 (1970), 85\u2013127.","journal-title":"Uspekhi Mat. Nauk"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01698128.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01698128\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01698128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T10:13:53Z","timestamp":1586254433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01698128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,3]]}},"alternative-id":["BF01698128"],"URL":"https:\/\/doi.org\/10.1007\/bf01698128","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,3]]}}}