 | | Re: recursion (was RE: Would-be hacker queries.) —Ben Laurie
| | | | (...) 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)
| | | | | | | | | | Re: recursion (was RE: Would-be hacker queries.) —Malcolm S. Powell
| | | | | | 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 (...) (25 years ago, 13-May-99, to lugnet.robotics)
| | | | | | | | | | | | Re: recursion (was RE: Would-be hacker queries.) —Peter Hesketh
| | | | | In article <373AA2D3.2A4E812B@a...up.co.uk>, Ben Laurie <ben@algroup.co.uk> writes (...) Is this the same Mr Ackerman who invented Ackerman steering? (25 years ago, 13-May-99, to lugnet.robotics)
| | | | | | |
