Re: Turing Machines

Article View: rec.puzzles

Article #2545

#2545

From: Dave Seaman
Date: Tue, 26 Jan 1993 14:27

15 lines
972 bytes

In article <1k2ltpINNs62@gap.caltech.edu> carl@SOL1.GPS.CALTECH.EDU (Carl  
J Lydick) writes:
> In article <728019101.AA05890@csource.oz.au>,  
Ben.White@f364.n633.z3.fidonet.org (Ben White) writes:
> >Has anyone here ever constructed a universal turing machine? 
> I tried once, but I ran out of memory :-).  Seriously, by imposing the
> adjective "universal," you've required that the machine have infinite  
memory.

Wrong adjective. All turing machines, universal or not, have infinite  
memory. 

--
Dave Seaman
ags@seaman.cc.purdue.edu

Technical Details

Message-ID: <C1GtHr.n7@mentor.cc.purdue.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!decwrl!purdue!mentor.cc.purdue.edu!news

References: <1k2ltpINNs62@gap.caltech.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!decwrl!purdue!mentor.cc.purdue.edu!news
From: ags@seaman.cc.purdue.edu (Dave Seaman)
Newsgroups: rec.puzzles
Subject: Re: Turing Machines
Message-ID: <C1GtHr.n7@mentor.cc.purdue.edu>
Date: 26 Jan 93 14:27:26 GMT
Article-I.D.: mentor.C1GtHr.n7
References: <1k2ltpINNs62@gap.caltech.edu>
Sender: news@mentor.cc.purdue.edu (USENET News)
Organization: Purdue University
Lines: 15

Reply to Parent Message