- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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.Author's Profile
Panu Raatikainen
Tampere University
Other Versions
No versions found
My notes
Similar books and articles
Vagueness, rationality and undecidability: A theory of why there is vagueness.Mark A. Changizi - 1999 - Synthese 120 (3):345 - 374.
The Incompleteness of Theories of Games.Marcelo Tsuji, Newton C. A. Da Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553 - 568.
The incompleteness of theories of games.Marcelo Tsuji, Newton C. A. Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553-568.
Pour-el’s landscape.Taishi Kurahashi & Albert Visser - 2024 - Bulletin of Symbolic Logic 30 (3):362-397.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Analytics
Added to PP
2009-01-28
Downloads
1,161 (#17,692)
6 months
115 (#54,015)
2009-01-28
Downloads
1,161 (#17,692)
6 months
115 (#54,015)
Historical graph of downloads
Author's Profile
Panu Raatikainen
Tampere University
Citations of this work
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.
The Equivalence of Definitions of Algorithmic Randomness.Christopher Porter - 2021 - Philosophia Mathematica 29 (2):153–194.
On explicating the concept the power of an arithmetical theory.Jörgen Sjögren - 2008 - Journal of Philosophical Logic 37 (2):183 - 202.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
The concept of truth in formalized languages.Alfred Tarski - 1956 - In Logic, semantics, metamathematics. Oxford,: Clarendon Press. pp. 152--278.
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Trial and error predicates and the solution to a problem of Mostowski.Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):49-57.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-99fc7d78b-s277s uwo