Subject:
|
Re: recursion (was RE: Would-be hacker queries.)
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Thu, 13 May 1999 17:22:55 GMT
|
Original-From:
|
Malcolm S Powell <msp@umbra.coSAYNOTOSPAM.uk>
|
Viewed:
|
1037 times
|
| |
|
|
Ackermann's Function
--------------------
Function ack(n, m: integer): integer;
Begin
If m = 0 Then ack = n + 1
Else
If n = 0 Then ack = ack(m-1, 1)
Else ack = ack(m-1, ack(m, n-1))
End;
Funny what sticks in your mind!
As far as I know, the only significance that this function ever had was
its use by compiler writers (myself included) to test their generated
code for routine calls and parameter passing.
Malcolm
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message is in Reply To:
 | | Re: recursion (was RE: Would-be hacker queries.)
|
| (...) I seem to remember the point of the Ackermann function is that the amount of computation required to evaluate it explodes very rapidly with small changes in parameter values, and it is recursive and rather simple. I also seem to remember "so (...) (25 years ago, 13-May-99, to lugnet.robotics)
|
21 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
