Synthese 123 (2):217-225 (2000)

Authors
Panu Raatikainen
University of Tampere
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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive
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

The Concept of Truth in Formalized Languages.Alfred Tarski - 1936 - In A. Tarski (ed.), Logic, Semantics, Metamathematics. Oxford University Press. pp. 152--278.
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..

View all 14 references / Add more references

Citations of this work BETA

On the Philosophical Relevance of Gödel's Incompleteness Theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
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 - 2008 - 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.

Analytics

Added to PP index
2009-01-28

Total views
290 ( #24,308 of 2,324,555 )

Recent downloads (6 months)
17 ( #37,527 of 2,324,555 )

How can I increase my downloads?

Downloads

My notes