Re: Hardware random generators and nondeterminsm



Tim Tyler <seemysig@xxxxxxxxxxxxxx> wrote:

rpost wrote:
coonalkadam07@xxxxxxxxx wrote:

Firstly, all machines built by human hands are finite state machines
because infinite tapes simply do not exist.

Wrong.

The Turing machine is a very finite machine. It doesn't require an
infinite tape. All it requires is that tape is supplied as needed.

Some programs do require an infinite tape - and if you can't execute
those, your supposed Turing machine is not universal.

If a program required an infinite tape, wouldn't that program be
non-halting?
--
Regards,
Casey
.

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: Undecidability in Physics
    ... A Turing Machine has an infinite tape, so it cannot be realized as 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. ... What Turing's Theorem (mutatis mutandis) shows is ...
    (sci.logic)
  • 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)