A Theory of Program Size Formally Identical to Information Theory
Tóm tắt
Từ khóa
Tài liệu tham khảo
SOLOMONOFF , R.J . A formal theory of inductive inference . Inform. and Contr. 7 ( 1964 ), 1 - 22 , 224-254. SOLOMONOFF, R.J. A formal theory of inductive inference. Inform. and Contr. 7 (1964), 1-22, 224-254.
KOLMOGOROV , A.N . Three approaches to the quantitative definition of information . Problems of Inform. Transmission 1 , 1 (Jam- March 1965 ), 1-7. KOLMOGOROV, A.N. Three approaches to the quantitative definition of information. Problems of Inform. Transmission 1, 1 (Jam-March 1965), 1-7.
~OLMOGOROV , A.N. On the logical foundations of information theory and probability theory. Problems of Inform. Transmission 5, 3 (July-Sept . 1969 ), 1-4. ~OLMOGOROV, A.N. On the logical foundations of information theory and probability theory. Problems of Inform. Transmission 5, 3 (July-Sept. 1969), 1-4.
LOVELAND , D.W . A variant of the Kolmogorov concept of complexity . Inform. and Contr. 15 ( 1969 ), 510 - 526 . LOVELAND, D.W. A variant of the Kolmogorov concept of complexity. Inform. and Contr. 15 (1969), 510-526.
SCHNORR , C.P . Process complexity and effective random tests . J. Comput. and Syst. Scis. 7 ( 1973 ), 376 - 388 . SCHNORR, C.P. Process complexity and effective random tests. J. Comput. and Syst. Scis. 7 (1973), 376-388.
CHAITIN , G.J. On the difficulty of computations. 1EEE Trans. IT-16 ( 1970 ), 5-9. CHAITIN, G.J. On the difficulty of computations. 1EEE Trans. IT-16 (1970), 5-9.
FEINSTEIN , A. Foundations of Information Theory . McGraw-Hill , New York , 1958 . FEINSTEIN, A. Foundations of Information Theory. McGraw-Hill, New York, 1958.
FANO , R. M. Transmission of Information . Wiley , New Nork , 1961 . FANO, R. M. Transmission of Information. Wiley, New Nork, 1961.
ABRAMSON , N. Information Theory and Coding . McGraw-Hill , New York , 1963 . ABRAMSON, N. Information Theory and Coding. McGraw-Hill, New York, 1963.
AsH, R. Information Theory . Wiley-Interscience , New York , 1965 . AsH, R. Information Theory. Wiley-Interscience, New York, 1965.
ZVONKIN , A. K. , AN n LE VlN , L. A. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Survs. 25, 6 (Nov.-Dec . 1970 ), 83-124. ZVONKIN, A. K., ANn LEVlN, L.A. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Survs. 25, 6 (Nov.-Dec. 1970), 83-124.
COVER , T.M. Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin. Rep. No. 12, Statistics Dep., Stanford U., Stanford , Calif. , 1974 . Submitted to Ann. Statist. COVER, T.M. Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin. Rep. No. 12, Statistics Dep., Stanford U., Stanford, Calif., 1974. Submitted to Ann. Statist.
WEISS , B . The isomorphism problem in ergodic theory . Bull. Amer. Math. Soc. 78 ( 1972 ), 668 - 684 . WEISS, B. The isomorphism problem in ergodic theory. Bull. Amer. Math. Soc. 78 (1972), 668-684.
R~NYI , A. Foundations of Probability . Holden-Day , San Francisco , 1970 . R~NYI, A. Foundations of Probability. Holden-Day, San Francisco, 1970.
FINE , T . L . Theories of Probability: An Examination of Foundations . Academic Press , New York , 1973 . FINE, T .L . Theories of Probability: An Examination of Foundations. Academic Press, New York, 1973.
COVER , T.M . On determining the irrationality of the mean of a random variable . Ann. Statist. 1 ( 1973 ), 862 - 471 . COVER, T.M. On determining the irrationality of the mean of a random variable. Ann. Statist. 1 (1973), 862-471.
CHAITIN , G . J . Information-theoretic computational complexity . IEEE Trans. IT-20 ( 1974 ), 10 - 15 . CHAITIN, G .J . Information-theoretic computational complexity. IEEE Trans. IT-20 (1974), 10-15.
LE vis, M . Mathematical Logic for Computer Scientists. Rep. TR-131 , M.I.T. Project MAC , 1974 , pp. 145 - 147 , 153. LEvis, M. Mathematical Logic for Computer Scientists. Rep. TR-131, M.I.T. Project MAC, 1974, pp. 145-147, 153.
MINSKY , M. L. Computation: Finite and Infinite Machines . Prentice-Hall , Englewood Cliffs, N. J. , 1967 , pp. 54 , 55, 66. MINSKY, M. L. Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, N. J., 1967, pp. 54, 55, 66.
MINSK~ , M. , AND PAPERT , S. Perceptrons: An Introduction to Computational Geometry . M.I.T. Press , Cambridge, Mass ., 1969 , pp. 150 , 153. MINSK~, M., AND PAPERT, S. Perceptrons: An Introduction to Computational Geometry. M.I.T. Press, Cambridge, Mass., 1969, pp. 150, 153.
SCHWARTZ , J . T . On Programming : An Interim Report on the SETL Project. Installment I: Generalities. Lecture Notes, Courant Institute , New York University , New York , 1973 , pp. 1 - 20 . SCHWARTZ, J .T . On Programming: An Interim Report on the SETL Project. Installment I: Generalities. Lecture Notes, Courant Institute, New York University, New York, 1973, pp. 1-20.
BENNETT , C.H . Logical reversibility of computation . IBM J. Res. Develop. 17 ( 1973 ), 525 - 532 . BENNETT, C.H. Logical reversibility of computation. IBM J. Res. Develop. 17 (1973), 525-532.
DALEY R .P . The extent and density of sequences within the minimal-program complexity hierarchies. J. Comput. and Syst. Scis. (to appear). 10.1016/S0022-0000(74)80004-8 DALEY R .P . The extent and density of sequences within the minimal-program complexity hierarchies. J. Comput. and Syst. Scis. (to appear). 10.1016/S0022-0000(74)80004-8
CHAITIN G. J. Information-theoretic characterizations of recursive infinite strings. Submitted to Theoretical Comput. Sci. CHAITIN G. J. Information-theoretic characterizations of recursive infinite strings. Submitted to Theoretical Comput. Sci.
ELIAS P. Minimum times and memories needed to compute the values of a function. J. Cornput. and Syst. Scis. (to appear). 10.1016/S0022-0000(74)80007-3 ELIAS P. Minimum times and memories needed to compute the values of a function. J. Cornput. and Syst. Scis. (to appear). 10.1016/S0022-0000(74)80007-3
HELLMAN , M.E. The information theoretic approach to cryptography . Center for Systems Research , Stanford U. , Stanford, Calif., 1974 . HELLMAN, M.E. The information theoretic approach to cryptography. Center for Systems Research, Stanford U., Stanford, Calif., 1974.
CHAITI~ , G.J. Randomness and mathematical proof. Sc/. Amer. ~35, 5 (May 1975 ), in press. CHAITI~, G.J. Randomness and mathematical proof. Sc/. Amer. ~35, 5 (May 1975), in press.