Q:

Is Physics Computable?

Is it possible for a Turing machine to simulate physics accurately? 
  
For the problem of reals, I was thinking of the following:
For each real,
$2^1, 2^2, ...., 2^n, ...$ memory cells store the first real.
$3^1, 3^2, ...., 3^n, ...$ memory cells store the second real.
$...$
$...$
$...$
$m^1, m^2, ...., m^n, ...$ memory cells store the $m-1^\text{th}$ real.
 
So if the Turing machine had arbitrarily large speed could it render a perfect simulation of our Universe?
 
Bonus:
If an ordinary Turing machine cannot simulate physics, then in addition to the above, The machine as the following property.
Let $t$ represent one time step.
In first $1t$ it performs $1$ primitive operation.
In next $.5t$ it performs $2$ primitive operations.
In next $.25t$ it performs $4$ primitive operations.
$...$
In next $2^{-n}t$ it performs $2^n$ primitive operations.   
Operation resets every 2t.   

My question is whether it is possible in principle for an infinite state Turing machine to capture this universe. Whether it is possible for this universe to be simulated within the limits of computation. It is not necessary for the machine that simulates the Universe to be physically realisable. The machine may e.g have infinite computational speed. 
Assuming certain real constants would be needed in the computation, the above was to suggest a method for a computer to manipulate real numbers without truncation. 

A:

Any real computer must be a physical system and so must obey the laws of physics. So in any real computer, the speed at which information can be transmitted is less than or equal to the speed of light.
However, a universal computer can simulate a physical to any finite accuracy:
https://people.eecs.berkeley.edu/~christos/classics/Deutsch_quantum_theory.pdf

