Incompleteness, complexity, randomness and beyond

Minds and Machines 12 (4):503-517 (2002)

Abstract

Gödel's Incompleteness Theorems have the same scientific status as Einstein's principle of relativity, Heisenberg's uncertainty principle, and Watson and Crick's double helix model of DNA. Our aim is to discuss some new faces of the incompleteness phenomenon unveiled by an information-theoretic approach to randomness and recent developments in quantum computing.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,855

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
119 (#101,090)

6 months
1 (#386,031)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Cristian S. Calude
University of Auckland

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Russell's Mathematical Logic.Kurt Gödel - 1944 - In Solomon Feferman, John Dawson & Stephen Kleene (eds.), Journal of Symbolic Logic. Northwestern University Press. pp. 119--141.

View all 23 references / Add more references

Citations of this work

No citations found.

Add more citations