To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.roboticsOpen lugnet.robotics in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 Robotics / 5071 (+10)
  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: 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
 
(...) 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.) (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: 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.)
 
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: You know, all this computer science talk doesn't really belong here.
 
(...) another group to disuade people (...) iteration versus recursion (...) which is actually supposed (...) At the risk of taking another thread down, I would caution you about taking this attitude. I am one of the first to admit that the (...) (28 years ago, 13-May-99, to lugnet.robotics)
 
  Re: recursion (was RE: Would-be hacker queries.) (fwd)
 
----- Forwarded message from Paul Speed ----- Date: Thu, 13 May 1999 12:50:37 -0400 From: Paul Speed <pspeed@augustschell.com> Subject: Re: recursion (was RE: Would-be hacker queries.) (fwd) (...) How would it jump back to the original tape? ----- (...) (28 years ago, 13-May-99, to lugnet.robotics)
 
  Re: Lego "pegging" disks
 
(...) Now that you mention them I remember I have some too! Pre-Technic Lego gears. They are HUGE. I guess I got mine in the first half of the seventies. There was a very nice black chain too with two studs on each piece, ideal to join any standard (...) (28 years ago, 13-May-99, to lugnet.robotics, lugnet.build)
 
  Re: recursion (was RE: Would-be hacker queries.) (fwd)
 
(...) Yep, my question was merely meant to provoke discussion on if the original point could actually be used to prove or disprove all recursion being able to be implemented as iteration. Ugh, what a sentence. Essentially it still just boils down to (...) (28 years ago, 13-May-99, to lugnet.robotics)

Next Page:  5 more | 10 more | 20 more
Redisplay Messages:  All | Compact

©2005 LUGNET. All rights reserved. - hosted by steinbruch.info GbR