Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site uvaee.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!unc!mcnc!ncsu!uvacs!uvaee!tet
From: tet@uvaee.UUCP (Thomas E. Tkacik)
Newsgroups: net.math
Subject: Re: Re: Beyond Exponentiation
Message-ID: <173@uvaee.UUCP>
Date: Fri, 1-Feb-85 09:31:58 EST
Article-I.D.: uvaee.173
Posted: Fri Feb  1 09:31:58 1985
Date-Received: Sun, 3-Feb-85 09:34:37 EST
References: <186@ihnet.UUCP> <616@spuxll.UUCP>
Organization: EE Dept., U of Virginia, Charlottesville
Lines: 11

> I suggest you look at Ackermann's classic function,

Ackermann's function is an example of a generally recursive function.
I have been told that any generally recursive function can be 
rewritten in an interative form, and will execute faster (on a computer).

Does anyone know how Ackermann's function can be defined without
using recursion?

---
Tom Tkacik     decvav!mcnc!ncsu!uvacs!uvaee!tet