home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / sci / logic / 1339 < prev    next >
Encoding:
Text File  |  1992-09-02  |  615 b   |  16 lines
  1. Organization: Carnegie Mellon, Pittsburgh, PA
  2. Path: sparky!uunet!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!news.sei.cmu.edu!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!andrew.cmu.edu!lb0q+
  3. Newsgroups: sci.logic
  4. Message-ID: <UedH4ge00WB80CdOB6@andrew.cmu.edu>
  5. Date: Wed,  2 Sep 1992 17:25:00 -0400 
  6. From: Leslie Burkholder <lb0q+@andrew.cmu.edu>
  7. Subject: infinite state automaton
  8. In-Reply-To: <OZ.92Sep1203824@ursa.sis.yorku.ca>
  9. Lines: 5
  10.  
  11. Suppose we allow an automaton to have an infinite rather than a finite
  12. number of states. Is that (equivalent to) a Turing machine? References,
  13. please.
  14. Thanks,
  15. Leslie Burkholder
  16.