110 citations found. Retrieving documents...
G. Chaitin, A theory of program size formally identical to information theory, Journal of the ACM 22, (1975) 329--340.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

From Heisenberg to Gödel via Chaitin - Calude, Stay (2004)   Self-citation (Chaitin)   (Correct)

No context found.

G.J. Chaitin. A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (


Information-theoretic Incompleteness - Chaitin (1992)   (9 citations)  Self-citation (Chaitin)   (Correct)

No context found.

G. J. Chaitin, "A theory of program size formally identical to information theory," Journal of the ACM 22 (1975), 329--340.


Information-theoretic Limitations of Formal Systems - Chaitin (1974)   (4 citations)  Self-citation (Chaitin)   (Correct)

No context found.

Chaitin, G. J. A theory of program size formally identical to information theory. Res. Rep. RC4805, IBM Res. Center, Yorktown Heights, N.Y.,


Book Review - The Mathematical Intelligencer   Self-citation (Chaitin)   (Correct)

No context found.

Gregory J. Chaitin, A theory of program size formally identical to information theory, Information, Randomness & Incompleteness---Papers on Algorithmic Information Theory, Second Edition, Singapore: World Scientific (1990), 113--128.


Lowness Properties of Reals and Randomness - Nies (2002)   (2 citations)  Self-citation (Chaitin)   (Correct)

No context found.

G. Chaitin. A theory of program size formally identical to information theory. J. Assoc. Comput. Mach., 22:329--340, 1975.


Some Recent Progress in Algorithmic Randomness - Downey   (Correct)

No context found.

G. Chaitin, A theory of program size formally identical to information theory, Journal of the ACM 22, (1975) 329--340.


Recursive Computational Depth - Lathrop, Lutz (1999)   (2 citations)  (Correct)

No context found.

G. J. Chaitin. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery, 22:329--340, 1975.


Randomness, relativization, and Turing degrees - Nies, Stephan, Terwijn   (Correct)

No context found.

Gregory J. Chaitin, A theory of program size formally identical to information theory, Journal of the ACM 22 (1975) 329--340.


Trivial Reals - Downey, Hirschfeldt, Nies, Stephan (2002)   (3 citations)  (Correct)

No context found.

G. Chaitin, A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery 22 (1975), 329--340, reprinted in [4].


Structural Properties of D.C.E. Degrees and Presentations of C.E.. - Wu (2002)   (Correct)

No context found.

G. J. Chaitin, A theory of program size formally identical to information theory, Jour. of the ACM 22 (1975), 329-340.


Program Size Complexity for Possibly Infinite Computations - Becher, Figueira, Nies..   (Correct)

No context found.

G. J. Chaitin. A theory of program size formally identical to information theory, J. ACM, vol.22, 329--340, 1975.


Effective Fractal Dimensions - Lutz   (Correct)

No context found.

G. J. Chaitin. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery, 22:329-340, 1975.


Modeling Time-Bounded Prefix Kolmogorov Complexity - Juedes, Lutz   (Correct)

No context found.

G. J. Chaitin. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery, 22:329-340, 1975.


Lowness Properties and Randomness - Nies   (1 citation)  (Correct)

No context found.

G. Chaitin. A theory of program size formally identical to information theory. J. Assoc. Comput. Mach., 22:329--340, 1975.


The New AI: General & Sound & Relevant for Physics - Schmidhuber (2003)   (Correct)

No context found.

G.J. Chaitin. A theory of program size formally identical to information theory. Journal of the ACM, 22:329-340, 1975.


Gödel Machines: Self-Referential Universal Problem Solvers.. - Schmidhuber (2003)   (Correct)

No context found.

G.J. Chaitin. A theory of program size formally identical to information theory. Journal of the ACM, 22:329-340, 1975.


Enumerations of the Kolmogorov Function - Richard Beigel Harry   (Correct)

No context found.

Gregory Chaitin. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery, 22:329--340, 1975.


Inductive Inference Theory - A Unified Approach To Problems In.. - Solomonoff (1975)   (1 citation)  (Correct)

No context found.

Chaitin, G.J. "A Theory of Program Size Formally Identical to Information Theory", To appear in Journal of the Association of Computing Machinery.


Bias-Optimal Incremental Learning of Control.. - Schmidhuber..   (Correct)

No context found.

G.J. Chaitin. A theory of program size formally identical to information theory. Journal of the ACM, 22:329--340, 1975.


Bio-Steps Beyond Turing - Calude, Paun (2004)   (Correct)

No context found.

G.J. Chaitin. A theory of program size formally identical to information theory, J. Assoc. Comput. Mach., 22 (1975), 329--340.


Trivial Reals - Downey, Hirschfeldt, Nies, Stephan (2002)   (3 citations)  (Correct)

No context found.

Chaitin, G., A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery 22 (1975), 329--340.


Computably Enumerable Reals and Uniformly Presentable Ideals - Downey, Terwijn (2002)   (Correct)

No context found.

Chaitin, G., A theory of program size formally identical to information theory, Journal of the ACM 22 (1975) 329-340.


Trivial Reals - Downey, Hirschfeldt, Nies, Stephan (2002)   (3 citations)  (Correct)

No context found.

G. Chaitin, A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery 22 (1975), 329--340, reprinted in [4].


Towards a Universal Theory of Artificial Intelligence based on.. - Hutter (2000)   (2 citations)  (Correct)

No context found.

G. J. Chaitin. A theory of program size formally identical to information theory. Journal of the ACM, 22(3):329--340, 1975.


The Kolmogorov Complexity of Random Reals - Yu, Ding, Downey (2003)   (Correct)

No context found.

G. J. Chaitin. A theory of program size formally identical to information theory, J. Assoc. Comput. ach., Vol. 22 (1975), pp. 329-340.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC