Quote:
The difference lies only with the ability of a Turing machine to manipulate an unbounded amount of data. However, given a finite amount of time, a Turing machine (like a real machine) can only manipulate a finite amount of data.
leads to this:
Quote:
One way in which Turing machines are a poor model for programs is that many real programs, such as operating systems and word processors, are written to receive unbounded input over time, and therefore do not halt. Turing machines do not model such ongoing computation well (but can still model portions of it, such as individual procedures).
I'm not sure it really alters the natyre of my question, - which is basically given all the physical information is it always feasible to unravel the underlying logic. Never the less i am gratefull for the clarification.