Re: Undecidability in Physics

I haven't looked at the link you have provided but here are some
comments.

A Turing Machine has an infinite tape, so it cannot be realized as a
finite physical system. So I think what you mean to consider is a
finite automaton (essentially a Turing Machine with a finite tape).
Define the size of a finite automaton to be the number of its states.
Then, for any x, there exists y such that the behaviour of any finite
automata of size less than or equal to x can be predicted by a finite
automaton of size y. What Turing's Theorem (mutatis mutandis) shows is
that y > x (indeed y is much greater than x).

.

Relevant Pages

  • Re: "The map is not the Territory"...
    ... >> our normal senses and it is that world that determines how the world of ... Except for the infinite tape requirement is it technically ... a trivial matter to physically contract a Turing machine. ... the mathematics that describes how such a real physical device would operate ...
    (sci.physics)
  • Re: "The map is not the Territory"...
    ... >> our normal senses and it is that world that determines how the world of ... Except for the infinite tape requirement is it technically ... a trivial matter to physically contract a Turing machine. ... the mathematics that describes how such a real physical device would operate ...
    (sci.physics.relativity)
  • Re: Hardware random generators and nondeterminsm
    ... Tim Tyler wrote: ... The Turing machine is a very finite machine. ... Some programs do require an infinite tape - and if you can't execute ...
    (comp.theory)
  • Re: A case for HTML as a programming language
    ... "Thomas G. Marshall" schrieb: ... > Arthur J. O'Dwyer coughed up: ... but a Turing machine without an infinite tape is not a Turing ...
    (comp.programming)