Algorithmic information theory and undecidability

Synthese 123 (2):217-225 (2000)
Abstract
Chaitin’s incompleteness result related to random reals and the halting probability has been advertised as the ultimate and the strongest possible version of the incompleteness and undecidability theorems. It is argued that such claims are exaggerations.
Keywords Philosophy   Philosophy   Epistemology   Logic   Metaphysics   Philosophy of Language
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005298819345
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
On Explicating the Concept the Power of an Arithmetical Theory.Jörgen Sjögren - 2008 - Journal of Philosophical Logic 37 (2):183 - 202.
Epistemic Optimism.Mihai Ganea - 2007 - Philosophia Mathematica 16 (3):333-353.

Add more citations

Similar books and articles
Computational Complexity and Godel's Incompleteness Theorem.Gregory J. Chaitin - 1970 - [Rio De Janeiro, Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
On Interpreting Chaitin's Incompleteness Theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
Algorithmic Randomness in Empirical Data.W. J. - 2003 - Studies in History and Philosophy of Science Part A 34 (3):633-646.
Intrinsic Information.John D. Collier - 1990 - In Philip P. Hanson (ed.), Information, Language and Cognition. University of British Columbia Press. pp. 1--390.
Added to PP index
2009-01-28

Total downloads
111 ( #46,042 of 2,193,222 )

Recent downloads (6 months)
2 ( #145,545 of 2,193,222 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature