Path: utzoo!attcan!uunet!fernwood!decwrl!mips!zaphod.mps.ohio-state.edu!uwm.edu!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!m.cs.uiuc.edu!gillies
From: gillies@m.cs.uiuc.edu
Newsgroups: comp.edu
Subject: Re: Recursion Summary
Message-ID: <4200042@m.cs.uiuc.edu>
Date: 28 Oct 90 05:20:00 GMT
References: <211651@<1990Oct23>
Lines: 7
Nf-ID: #R:<1990Oct23:211651:m.cs.uiuc.edu:4200042:000:306
Nf-From: m.cs.uiuc.edu!gillies    Oct 27 23:20:00 1990


> How about a non recursive algorithm for the Ackerman function ?

A dumb suggestion, actually, since the "interesting" values of the
Ackerman function can be stored in ten memory cells, and the other
values are too large to hold in main memory, and would take until the
end of the universe to compute....