Algorithmic information theory and undecidability

Synthese 123 (2):217-225 (2000)
Download Edit this record How to cite View on PhilPapers
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
PhilPapers/Archive ID
Revision history
Archival date: 2017-01-01
View upload history
References found in this work BETA

View all 14 references / Add more references

Citations of this work BETA

Add more citations

Added to PP index

Total views
285 ( #15,298 of 48,758 )

Recent downloads (6 months)
22 ( #29,780 of 48,758 )

How can I increase my downloads?

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