An Incompleteness Theorem for Calculating the Future
This paper proves that one can not build a computer which can, for any physical system, take the specification of that system's state as input and then correctly predict its future state before that state actually occurs. Loosely speaking, this means that one can not build a physical computer which can be assured of "processing information faster than the universe." This result holds even if one restricts one's attention to predicting the states of systems which are finite, purely classical, and obey dynamics which is not chaotic, and even if one uses an infinitely fast, infinitely dense computer. Key words. uncompatibility, incompleteness, time-series analysis, indecidability.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Mar 1996|
|Date of revision:|
|Contact details of provider:|| Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501|
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:96-03-008. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.