 | | 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)
|
| |
 | | RE: Lego "pegging" disks
|
|
(...) But they DID, way, way back. I still have a set (2 Yellow 3 blue and 2 red) of the old BIG tooth gears. The yellow set is about the size of an 8x8 plate nad has a 5x5 grid of holes. The set has the old white Technic axles and red bushings. (...) (28 years ago, 13-May-99, to lugnet.robotics, lugnet.build)
|
| |
 | | Re: Fishing for a tasty linkage/gearing/robotic building thread...
|
|
(...) I have a fully functional version that doesn't use either - or any special parts. I wish I had a digital camera to take some decent pictures. I have one photo taken with a Polaroid. I'll put it on my web site tonight. In the mean time, I'll (...) (28 years ago, 13-May-99, to lugnet.robotics)
|
| |
 | | RE: recursion (was RE: Would-be hacker queries.) (fwd)
|
|
----- Forwarded message from Blake Winton ----- From: Blake Winton <Blake.Winton@pcdocs.com> Subject: RE: recursion (was RE: Would-be hacker queries.) Date: Thu, 13 May 1999 11:40:10 -0400 (From (URL) searching for "The Ackermann Function") The url (...) (28 years ago, 13-May-99, to lugnet.robotics)
|
| |
 | | Re: recursion (was RE: Would-be hacker queries.)
|
|
(...) What do you mean? The algorithm a CPU uses (at least, any I'm familiar with) to execute code is an iterative algorithm (i.e. fetch instructions, decode, execute, go round again). Cheers, Ben. -- (URL) grandfather once told me that there are (...) (28 years ago, 13-May-99, to lugnet.robotics)
|
| |
 | | RE: recursion (was RE: Would-be hacker queries.)
|
|
(...) (From (URL) searching for "The Ackermann Function") The url to a description of Ackermann's function: (URL) excerpt from that page: Ackermann's function, while Turing computable, grows faster than any primitive recursive function. This means (...) (28 years ago, 13-May-99, to lugnet.robotics)
|