{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:48:06Z","timestamp":1768909686446,"version":"3.49.0"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90081-2","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"9-33","source":"Crossref","is-referenced-by-count":63,"special_numbering":"C","title":["On the notion of infinite pseudorandom sequences"],"prefix":"10.1016","volume":"48","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90081-2_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machines","volume":"11","author":"Blum","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90081-2_BIB2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","article-title":"A simple secure pseudo-random number generator","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90081-2_BIB3","series-title":"Proc. 23rd IEEE Symp. on Foundations of Computer Science","first-page":"112","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/0304-3975(86)90081-2_BIB4","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(86)90081-2_BIB5","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(86)90081-2_BIB6","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(86)90081-2_BIB7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","article-title":"On the concept of random sequence","volume":"46","author":"Church","year":"1940","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(86)90081-2_BIB8","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2272040","article-title":"Noncomplex sequences: characterizations and examples","volume":"41","author":"Daley","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(86)90081-2_BIB9","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1145\/321541.321551","article-title":"Random sets in subrecursive hierarchies","volume":"16","author":"Di Paola","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(86)90081-2_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(86)90081-2_BIB11","series-title":"Proc. 24th IEEE Symp. on Foundations of Computer Science","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0304-3975(86)90081-2_BIB12","unstructured":"J. Hartmanis, Personal communication, 1985."},{"key":"10.1016\/0304-3975(86)90081-2_BIB13","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0304-3975(86)90081-2_BIB14","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(86)90081-2_BIB15","first-page":"265","article-title":"Universal sorting problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(86)90081-2_BIB16","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(86)90081-2_BIB17","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","article-title":"A variant of the Kolmogorov concept of complexity","volume":"15","author":"Loveland","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90081-2_BIB18","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(86)90081-2_BIB19","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1111\/j.1755-2567.1969.tb00357.x","article-title":"The literature on Von Mises' Kollektivs revisited","volume":"35","author":"Martin-L\u00f6f","year":"1969","journal-title":"Theoria"},{"key":"10.1016\/0304-3975(86)90081-2_BIB20","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":"Z. Wahrsch. Verw. Gebiete"},{"key":"10.1016\/0304-3975(86)90081-2_BIB21","series-title":"Theory of Machines and Computations","first-page":"19","article-title":"Computationally complex and pseudorandom zero-one valued functions","author":"Meyer","year":"1971"},{"key":"10.1016\/0304-3975(86)90081-2_BIB22","series-title":"Proc. 20th IEEE Symp. on Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0304-3975(86)90081-2_BIB23","series-title":"Proc. 23rd IEEE Symp. on Foundations of Computer Science","first-page":"153","article-title":"Inferring a sequence generated by a linear congruence","author":"Plumstead","year":"1982"},{"key":"10.1016\/0304-3975(86)90081-2_BIB24","article-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","volume":"218","author":"Schnorr","year":"1971"},{"key":"10.1016\/0304-3975(86)90081-2_BIB25","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(86)90081-2_BIB26","doi-asserted-by":"crossref","first-page":"329","DOI":"10.2307\/2272862","article-title":"General random sequences and learnable sequences","volume":"42","author":"Schnorr","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(86)90081-2_BIB27","series-title":"Proc. 8th Internat. Coll. on Automata, Languages, and Programming","article-title":"On the generation of cryptographically strong pseudorandom sequences","author":"Shamir","year":"1981"},{"key":"10.1016\/0304-3975(86)90081-2_BIB28","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(86)90081-2_BIB29","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01203155","article-title":"Grundlagen der Wahrscheinlichkeitsrechnung","volume":"5","author":"Von Mises","year":"1919","journal-title":"Math. Z."},{"key":"10.1016\/0304-3975(86)90081-2_BIB30","first-page":"38","article-title":"Die Widerspruchsfreiheit des Kollektivbegriffes der Wahrscheinlichkeitsrechnung","volume":"8","author":"Wald","year":"1937"},{"key":"10.1016\/0304-3975(86)90081-2_BIB31","series-title":"Proc. 24th IEEE Symp. on Foundations of Computer Science","first-page":"335","article-title":"Randomness and the density of hard problems","author":"Wilber","year":"1983"},{"key":"10.1016\/0304-3975(86)90081-2_BIB32","series-title":"Proc. 23rd IEEE Symp. on Foundations of Computer Science","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"},{"key":"10.1016\/0304-3975(86)90081-2_BIB33","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. Survey"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900812?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900812?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:54:00Z","timestamp":1553201640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":33,"alternative-id":["0304397586900812"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90081-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}