2000/05/23 by David H. Wolpert, Wolpert, David H.
Computer Science · #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #Computational Physics (physics.comp-ph) #Computational Physics and Python Applications #FOS: Computer and information sciences #FOS: Physical sciences #General Physics (physics.gen-ph) #Mathematical Physics (math-ph) #Parallel Computing and Optimization Techniques #Statistical Mechanics (cond-mat.stat-mech)
paper · pdf · doi:10.48550/arxiv.physics/0005058
openalex publication_date 2000/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical universe. Next it is proven that no physical computer C can correctly carry out any computational task in the subset of such tasks that can be posed to C. As a particular example, this means that there cannot be a physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs. The results also mean that there cannot exist an infallible, general-purpose observation apparatus, and that there cannot be an infallible, general-purpose control apparatus. These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine.