> In computers, floating point numbers have a limited precision, based on how many bits are used. Does the innate 'error' in floating point numbers have implications on your theory of 'Computational Irreducability'? Are the 'errors' introduced with each floating point operation is fundamentally computationally irreducable? Does this have a domino effect that causes basic classical mechanics to become computationally irreducible? Like the integration of velocity into position, it is a O(1) operation to compute the future position given a velocity and a starting point, but if a computer is rendering each individual frame, it will accumulate error in each frame, and the final frame may end up in a different position. Does this concept relate to the real world through things like the Planck length? Is space perhaps not purely continuous?