This is a preview of subscription content, log in via an institution to check access.
References
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–1254.
G. Chaitin, On the length of programs for computing finite binary sequences,J. Assoc. Comput. Mach. 13 (1966), 547–569.
G. Chaitin, On the length of programs for computing finite binary sequences; statistical considerations,J. Assoc. Comput. Mach. 16 (1969), 145–159.
A. Church, On the concept of a random sequence,Bull. Amer. Math. Soc. 46 (1940), 130–135.
R. Daley, Minimal-program complexity of pseudo-recursive and pseudo-random sequences, Carnegie-Mellon, Dept. of Math. Report, 71-28 (1971).
R. Daley, Minimal-program complexity of sequences with restricted resources,Information and Control 23 (1973), 301–312.
J. Dekker andJ. Myhill, Retraceable sets,Canadian J. Math. 10 (1958), 357–373.
T. Fine,Theories of Probability, Academic Press, New York, 1973.
A. Kolmogorov, Three approaches for defining the concept of information quantity,Peredachi Informatsii 1 (1965), 3–11; Amer. Math. Soc. Transl., Vol. 7, 1968.
A. Kolmogorov, Logical basis for information and probability theory,IEEE Trans. Information Theory IT-14 (1968), 662–664.
D. Loveland, Minimal-program complexity measure, Conference Record ACM Symposium on Theory of Computing, May 1968, pp. 61–65.
D. Loveland, A variant of the Kolmogorov concept of complexity,Information and Control 15 (1969), 510–526.
D. Loveland, A new interpretation of the von Mises concept of random sequence,Z. Math. Logik 12 (1966), 279–294.
D. Martin, Classes of r.e. sets of degrees of unsolvability,Z. Math. Logik 12 (1966), 295–310.
P. Martin-Löf, The definition of random sequences,Information and Control 9 (1966), 602–619.
H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
C. Schnorr, Optimal Gödel numberings, Proc. IFIP Congress (1971) Ljubljana, Yugoslavia, TA-2, pp. 12–14.
C. Schnorr, The process complexity and effective random tests,Proc. ACM Conf. on Theory of Computing (1972), pp. 168–176.
C. Schnorr, A unified approach to the definition of random sequences,Math. Systems Theory,5 (1971), 246–258.
C. Schnorr,Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, No. 218, Springer-Verlag, Berlin, 1971.
J. Ville,Étude Critique de la Notion de Collectif, Gauthiers-Villars, Paris, 1939.
V. Vuckovic, Almost recursive sets,Proc. Amer. Math. Soc. 23 (1969), 114–119.
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–127.
Author information
Authors and Affiliations
Additional information
The research reported here represents a portion of the author's Ph.D. dissertation at Carnegie-Mellon University under the supervision of Prof. Donald Loveland.
Rights and permissions
About this article
Cite this article
Daley, R.P. Minimal-program complexity of pseudo-recursive and pseudo-random sequences. Math. Systems Theory 9, 83–94 (1975). https://doi.org/10.1007/BF01698128
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01698128