Re: A case for HTML as a programming language

From: Michael Mendelsohn (keine.Werbung.1300_at_msgid.michael.mendelsohn.de)
Date: 11/10/04 

Date: Wed, 10 Nov 2004 09:29:37 +0100

"Thomas G. Marshall" schrieb:
> Arthur J. O'Dwyer coughed up:
> > 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?

You will be the sole culprit for the infamous Y2.15K problem!

Michael 

-- 
Still an attentive ear he lent        Her speech hath caused this pain
But could not fathom what she meant   Easier I count it to explain
She was not deep, nor eloquent.       The jargon of the howling main
                 -- from Lewis Carroll: The Three Usenet Trolls

Relevant Pages

  • Re: A case for HTML as a programming language
    ... > Arthur J. O'Dwyer coughed up: ... but a Turing machine without an infinite tape is not a Turing ... > {author ducks} ...
    (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)