Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!utgpu!water!watmath!clyde!rutgers!sri-spam!ames!sdcsvax!ucsdhub!hp-sdd!hplabs!otter!kers From: kers@otter.UUCP Newsgroups: comp.misc Subject: Re: The Ackermann function Message-ID: <1860002@otter.HP.COM> Date: Fri, 4-Dec-87 09:11:43 EST Article-I.D.: otter.1860002 Posted: Fri Dec 4 09:11:43 1987 Date-Received: Wed, 9-Dec-87 06:36:18 EST References: <2093@umd5.umd.edu> Organization: hplabs-brc Bristol,UK. Lines: 4 ackermans function is also notable, I seem to remember, for GROWING faster than any primitive recursive function. ackerman(i,i) gets VERY big VERY fast as i grows to largish values like 4, 4 etc ...