Path: utzoo!utgpu!water!watmath!clyde!rutgers!iuvax!pur-ee!uiucdcs!uxc.cso.uiuc.edu!ccvaxa!aglew
From: aglew@ccvaxa.UUCP
Newsgroups: comp.misc
Subject: Re: The Ackermann function
Message-ID: <30800001@ccvaxa>
Date: 9 Dec 87 05:56:00 GMT
References: <2093@umd5.umd.edu>
Lines: 8
Nf-ID: #R:umd5.umd.edu:2093:ccvaxa:30800001:000:343
Nf-From: ccvaxa.UUCP!aglew    Dec  8 23:56:00 1987


I hate to say something like this, especially after somebody as
eminent as Reid has posted, but I vaguely remember that a function
related to Ackermann's was used as a complexity bound in a data
structures course I sat in on. Somehow munged to grow super slowly
instead of super fast.

Thanks to Brian for the intuitive explanation of A(n,j).