Authors
Leon Felkins
University of Memphis
Abstract
"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)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,163
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
14 ( #732,141 of 2,507,018 )

Recent downloads (6 months)
1 ( #417,155 of 2,507,018 )

How can I increase my downloads?

Downloads

My notes