Article View: comp.theory
Article #1781Re: FSM's to RM's
From: Christopher Menzel
Date: Wed, 05 Jun 1991 19:33
Date: Wed, 05 Jun 1991 19:33
11 lines
1265 bytes
1265 bytes
In article <3032@puck.sw.mcc.com>, meredith@puck.sw.mcc.com (LG Meredith) writes...
=>
=>A lot of people have asked me what a register machine is. My naivete
=>led me to believe that this was common parlance.
Not so naive, it seems to me; I would say that it is common parlance
in the context of computability theory. Cutland's excellent text
{\it Computability} uses register machines as the vehicle into the
theory. It deserves mention that functions computable by register
machines = functions computable by Turing machines = recursive
functions = etc.
Technical Details
Message-ID:
<16926@helios.TAMU.EDU>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!spool.mu.edu!caen!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!helios!zeus.tamu.edu!cpm5479References:
<3032@puck.sw.mcc.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!spool.mu.edu!caen!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!helios!zeus.tamu.edu!cpm5479 From: cpm5479@zeus.tamu.edu (Christopher Menzel) Newsgroups: comp.theory,sci.logic,sci.math Subject: Re: FSM's to RM's Keywords: finite state machines register machines Message-ID: <16926@helios.TAMU.EDU> Date: 5 Jun 91 19:33:16 GMT References: <3032@puck.sw.mcc.com> Sender: usenet@helios.TAMU.EDU Reply-To: cpm5479@zeus.tamu.edu Followup-To: comp.theory Organization: Academic Computing Services, Texas A&M University Lines: 11 News-Software: VAX/VMS VNEWS 1.3-4