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.
[1] R. Koppl. It is high time we take our ignorance more seriously , 1996 .
[2] J. Wheeler,et al. Quantum theory and measurement , 1983 .
[3] Zurek,et al. Algorithmic randomness and physical entropy. , 1989, Physical review. A, General physics.