Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!ub!uhura.cc.rochester.edu!rochester!fulk
From: fulk@cs.rochester.edu (Mark Fulk)
Newsgroups: comp.theory
Subject: Re: FSM's to RM's
Message-ID: <1991Jun14.205826.15044@cs.rochester.edu>
Date: 14 Jun 91 20:58:26 GMT
References: <1991Jun13.122113.29912@sics.se> <1991Jun13.154102.8494@cs.rochester.edu> <ROCKWELL.91Jun13210328@socrates.umd.edu>
Organization: Computer Science Department University of Rochester
Lines: 13

In article <ROCKWELL.91Jun13210328@socrates.umd.edu> rockwell@socrates.umd.edu (Raul Rockwell) writes:
>Er... make that 
>   FSA == Cray XMP < CA == PDA == TM
>
>On the other hand, a Cray XMP has very finite limits.

I think one is reasonably allowed to assume that the XMP has some
dismountable disk drives or tape drives, and that the total quantity
of tape truly available to a Cray is no less than that available to a TM.
Conventionally, that is taken to be unbounded.  Under those assumptions,
Cray == TM.

Mark