publication . Preprint . 2002

On the information-theoretic approach to G\"odel's incompleteness theorem

D'Abramo, Germano;
Open Access English
  • Published: 05 Nov 2002
Abstract
Comment: 6 pages, no figures. Few grammar corrections
Subjects
arXiv: Mathematics::Logic
free text keywords: Mathematics - History and Overview
Download from

[1] Chaitin, G. J. (1975). Randomness and mathematical proof, Scientific American, 232 (5) (May 1975), 47-52.

[2] Gardner, M. (1979). The random number Omega bids fair to hold the mysteries of the universe, Mathematical Games Dept., Scientific American, 241 (5) (November 1979), 20-34.

[3] Chaitin, G. J. (1974). Information-theoretic computational complexity, IEEE Transactions on Information Theory IT-20, pp. 10-15. [OpenAIRE]

[4] Chaitin, G. J. (1995). The Berry paradox, Complexity 1, No. 1, pp. 26-30.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue