Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!utgpu!water!watmath!clyde!rutgers!sri-unix!sri-spam!ames!oliveb!intelca!mipos3!cadev4!ekwok From: ekwok@cadev4.UUCP Newsgroups: comp.misc Subject: Re: The Ackermann function Message-ID: <1411@mipos3.intel.com> Date: Fri, 4-Dec-87 17:53:13 EST Article-I.D.: mipos3.1411 Posted: Fri Dec 4 17:53:13 1987 Date-Received: Wed, 9-Dec-87 06:32:51 EST References: <2093@umd5.umd.edu> Sender: nobody@mipos3.intel.com Reply-To: ekwok@cadev4.UUCP (Edward C. Kwok) Organization: John Q. Public & Sons Lines: 12 In article <2093@umd5.umd.edu> cgs@umd5.umd.edu (Chris Sylvain) writes: > >Would someone please explain to me what it is good for/what it models ? >Besides testing how long a function call takes, since it is nested very >deeply in some parts of the evaluation... >I keep getting 'introduced' to it, but never any history of it is provided. > It is good for generating overflow/underflow exceptions in machine where the representation of numbers are of finite length. Other than that, I don't know.