Algorithmic information theory

Journal of Symbolic Logic 54 (4):1389-1400 (1989)
We present a critical discussion of the claim (most forcefully propounded by Chaitin) that algorithmic information theory sheds new light on Godel's first incompleteness theorem
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274821
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,217
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
G. Kreisel & A. Lévy (1968). Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (7-12):97-142.

Add more references

Citations of this work BETA
Gérard G. Emch (2007). Models and the Dynamics of Theory-Building in Physics. Part I—Modeling Strategies. Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 38 (3):558-585.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

26 ( #182,739 of 1,932,483 )

Recent downloads (6 months)

2 ( #332,993 of 1,932,483 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.