"All the limitative Theorems of metamathematics and the theory of computation suggest that once the ability to represent your own structure has reached a certain critical point, that is the kiss of death: it guarantees that you can never represent yourself totally. Godel's Incompleteness Theorem, Church's Undecidability Theorem, Turing's Halting Problem, Turski's Truth Theorem -- all have the flavour of some ancient fairy tale which warns you that `To seek self-knowledge is to embark on a journey which...will always be incomplete, cannot be charted on a map, will never halt, cannot be described. " - Douglas R. Hofstadter..
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Beyond the Letter: A Philosophical Inquiry Into Ambiguity, Vagueness, and Metaphor in Language.Israel Scheffler - 1979 - Routledge & Kegan Paul.
The Surprise Examination Paradox and the Second Incompleteness Theorem.Shira Kritchman & Ran Raz - unknown
The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem.Saul A. Kripke - 2013 - In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Turing, Gödel, Church, and Beyond. MIT Press.
Ambiguity, Generality, and Indeterminacy: Tests and Definitions. [REVIEW]Brendan S. Gillon - 1990 - Synthese 85 (3):391 - 416.
A Generalization of Specker's Theorem on Typical Ambiguity.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (2):458-466.
Added to index2009-01-28
Total downloads8 ( #487,311 of 2,158,810 )
Recent downloads (6 months)1 ( #354,157 of 2,158,810 )
How can I increase my downloads?