Re: A case for HTML as a programming language

From: Edward G. Nilges (spinoza1111_at_yahoo.com)
Date: 12/01/04


Date: 30 Nov 2004 19:03:30 -0800


"Thomas G. Marshall" <tgm2tothe10thpower@replacetextwithnumber.hotmail.com> wrote in message news:<ay7kd.789$Bj2.389@trndny01>...
> Arthur J. O'Dwyer coughed up:
> > On Tue, 9 Nov 2004, Michael Mendelsohn wrote:
>
> ...[rip]...
>
> >> If we are talking about Turing machines with finite memories, i.e.
> >> finite tapes,
> >
> > Ah, but a Turing machine without an infinite tape is not a Turing
> > machine! So you mean "If we are talking about finite state machines,"
> > and you already said that. ;)
>
> I've always viewed this as a silly detail (sorry). If we live no longer
> than 150 years, then we merely need long enough tapes to last 150 years.
> Who cares what states there are beyond that, or if they even exist?

Ah, a mathematical Intuitionist. Good lad.
>
> {author ducks}



Relevant Pages

  • 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)
  • 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: 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)