Xref: utzoo comp.edu:3693 uw.general:1947
Path: utzoo!attcan!uunet!ogicse!dali.cs.montana.edu!milton!iho
From: iho@cac.washington.edu (Il Oh)
Newsgroups: comp.edu,uw.general
Subject: Re: Recursion Summary
Message-ID: <9893@milton.u.washington.edu>
Date: 25 Oct 90 05:12:06 GMT
References: <1990Oct23.211651.10227@contact.uucp> <9868@milton.u.washington.edu> <9882@milton.u.washington.edu>
Sender: news@milton.u.washington.edu
Reply-To: iho@akbar.UUCP (Il Oh)
Distribution: na
Organization: University of Washington, Seattle
Lines: 17

In article <9882@milton.u.washington.edu> mrc@Tomobiki-Cho.CAC.Washington.EDU (Mark Crispin) writes:
>
[stuff about recursion]
>
>Machines without hardware stack instructions can emulate them.
>
Doesn't this essentially prove my point?  That any recursive solution can
be also done in a nonrecursive algorithm without exception?  If I remember
my computing theory class, Turing machines are not capable of recursion.

As for your other inromation, I was unaware of the construction of modern
microprocessors, and I stand corrected.
--
  "Gosh!  You've really got          |    Il Hwan Oh
     some nice toys in here."        |    University of Washington, Tacoma
         -- Roy Batty, Bladerunner   |    iho@cac.washington.edu
                                     |