Xref: utzoo comp.lang.fortran:883 comp.lang.c:11153
Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!joyce!sri-unix!garth!smryan
From: smryan@garth.UUCP (Steven Ryan)
Newsgroups: comp.lang.fortran,comp.lang.c
Subject: Re: Should I convert FORTRAN code to C?
Message-ID: <885@garth.UUCP>
Date: 6 Jul 88 20:19:45 GMT
References: <2742@utastro.UUCP> <20008@beta.UUCP> <224@raunvis.UUCP> <750@garth.UUCP> <528@philmds.UUCP> <817@garth.UUCP> <63@cubsun.BIO.COLUMBIA.EDU> <879@garth.UUCP> <358@accelerator.eng.ohio-state.edu>
Reply-To: smryan@garth.UUCP (Steven Ryan)
Organization: INTERGRAPH (APD) -- Palo Alto, CA
Lines: 15

>>In Algorithmic Language and Program Development, Bauer and Wossner, they cite
>>Paterson and Hewitt as proving, essentially, recursion is more powerful than
>>iteration.
>>
>I don't know the learned gentlemen, but it is certainly true that for
>anything that can run on a computer, recursion is *at most* as strong
>as iteration.

I will step aside. The bibliography reference is, I think,

     Paterson M S, Hewitt C E (1970): Comparative Schematology. Record of
         the Project MAC Conference on Concurrent Systems and Parallel
         Computation, Woods Hole, Mass, 1970. New York: ACM 1970, p. 119-127

Have at it.