Algorithmic information theory and undecidability

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

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

Analytics

Added to PP
2009-01-28

Downloads
919 (#13,199)

6 months
76 (#49,861)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?