 | | Re: recursion (was RE: Would-be hacker queries.)
|
|
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 (...) (28 years ago, 13-May-99, to lugnet.robotics)
|
| |
 | | Re: recursion (was RE: Would-be hacker queries.)
|
|
(...) Is this a windup? The CPU, of course! (...) ^^^...^^^ of what? (...) Cheers, Ben. -- (URL) grandfather once told me that there are two kinds of people: those who work and those who take the credit. He told me to try to be in the first group; (...) (28 years ago, 13-May-99, to lugnet.robotics)
|
| |
 | | Re: recursion (was RE: Would-be hacker queries.) (fwd)
|
|
(...) How would it jump back to the original tape? -Paul (pspeed@progeeks.com) -- Did you check the web site first?: (URL) (28 years ago, 13-May-99, to lugnet.robotics)
|
| |
 | | Re: Lego "pegging" disks
|
|
(...) I have a co-woker who has an half-complete set of these in the original box -- I don't know the number -- but wow, they're cool. Is there any way I could find out what the market value of a complete set would be? Cheers, - jsproat (28 years ago, 13-May-99, to lugnet.robotics, lugnet.build)
|
| |
 | | Re: recursion (was RE: Would-be hacker queries.)
|
|
Is that a function of the CPU or the OS? -- Richard Clemens Associate Professor Computer Science Department West Virginia Wesleyan College Buckhannon, West Virginia 26201 clemens@wvwc.edu 304.473.8421 ----- Original Message ----- From: Ben Laurie (...) (28 years ago, 13-May-99, to lugnet.robotics)
|