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. <p> Key words. uncompatibility, incompleteness, time-series analysis, indecidability.
Year of publication: |
1996-03
|
---|---|
Authors: | Wolpert, David H. |
Institutions: | Santa Fe Institute |
Saved in:
Saved in favorites
Similar items by person
-
Self-Dissimilarity: An Empirical Measure of Complexity
Wolpert, David H., (1997)
-
What Bayes Has to Say About the Evidence Procedure
Wolpert, David H., (1995)
-
Estimating Functions of Probability Distributions From A Finite Set of Samples
Wolpert, David H., (1993)
- More ...