Algorithmic information theory and undecidability

Synthese 123 (2):217-225 (2000)
Download Edit this record How to cite View on PhilPapers
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.
Reprint years
2004
PhilPapers/Archive ID
RAAAIT
Upload history
Archival date: 2017-01-01
View other versions
Added to PP index
2009-01-28

Total views
354 ( #15,366 of 57,075 )

Recent downloads (6 months)
54 ( #13,458 of 57,075 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.