ACM Home Page
Please provide us with feedback. Feedback
A Theory of Program Size Formally Identical to Information Theory
Full text PdfPdf (870 KB)
Source Journal of the ACM (JACM) archive
Volume 22 ,  Issue 3  (July 1975) table of contents
Pages: 329 - 340  
Year of Publication: 1975
ISSN:0004-5411
Author
Gregory J. Chaitin  Rivadavia 3580, Dpto. 10A, Buenos Aires, Argentina and IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 75,   Citation Count: 45
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321892.321894
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
SOLOMONOFF, R.J. A formal theory of inductive inference. Inform. and Contr. 7 (1964), 1-22, 224-254.
 
2
KOLMOGOROV, A.N. Three approaches to the quantitative definition of information. Problems of Inform. Transmission 1, 1 (Jam-March 1965), 1-7.
3
4
 
5
~OLMOGOROV, A.N. On the logical foundations of information theory and probability theory. Problems of Inform. Transmission 5, 3 (July-Sept. 1969), 1-4.
 
6
LOVELAND, D.W. A variant of the Kolmogorov concept of complexity. Inform. and Contr. 15 (1969), 510-526.
 
7
SCHNORR, C.P. Process complexity and effective random tests. J. Comput. and Syst. Scis. 7 (1973), 376-388.
 
8
CHAITIN, G.J. On the difficulty of computations. 1EEE Trans. IT-16 (1970), 5-9.
 
9
FEINSTEIN, A. Foundations of Information Theory. McGraw-Hill, New York, 1958.
 
10
FANO, R. M. Transmission of Information. Wiley, New Nork, 1961.
 
11
ABRAMSON, N. Information Theory and Coding. McGraw-Hill, New York, 1963.
 
12
AsH, R. Information Theory. Wiley-Interscience, New York, 1965.
13
 
14
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.
 
15
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.
 
16
 
17
WEISS, B. The isomorphism problem in ergodic theory. Bull. Amer. Math. Soc. 78 (1972), 668-684.
 
18
R~NYI, A. Foundations of Probability. Holden-Day, San Francisco, 1970.
 
19
FINE, T .L . Theories of Probability: An Examination of Foundations. Academic Press, New York, 1973.
 
20
COVER, T.M. On determining the irrationality of the mean of a random variable. Ann. Statist. 1 (1973), 862-471.
 
21
CHAITIN, G .J . Information-theoretic computational complexity. IEEE Trans. IT-20 (1974), 10-15.
 
22
23
 
24
 
25
 
26
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.
 
27
BENNETT, C.H. Logical reversibility of computation. IBM J. Res. Develop. 17 (1973), 525-532.
 
28
DALEY, R .P . The extent and density of sequences within the minimal-program complexity hierarchies. J. Comput. and Syst. Scis. (to appear).
 
29
CHAITIN, G. J. Information-theoretic characterizations of recursive infinite strings. Submitted to Theoretical Comput. Sci.
 
30
ELIAS, P. Minimum times and memories needed to compute the values of a function. J. Cornput. and Syst. Scis. (to appear).
 
31
ELIAS, P. Universal codeword sets and representations of the integers. IEEE Trans. I T (to appear).
 
32
HELLMAN, M.E. The information theoretic approach to cryptography. Center for Systems Research, Stanford U., Stanford, Calif., 1974.
 
33
CHAITI~, G.J. Randomness and mathematical proof. Sc/. Amer. ~35, 5 (May 1975), in press.

CITED BY  45