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 / 5016 (+10)
  Re: Scheme (fwd)
 
On Tue, 11 May 1999, Jim Choate wrote: . . . (...) More details: In 1966, work began on LOGO at Bolt, Beranek, & Newman. The team was headed by Wally Fuerzeig and included Seymour Papert who later wrote the text which popularized LOGO: MindStorms. (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Fishing for a tasty linkage/gearing/robotic building thread...
 
Me too !! Kipling Morris wrote in message ... (...) against (...) I (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test... (correction)
 
Whoops! I typed the last two lines with the two aggregate operators interchanged! Obviously they should have read FUNCTION sum(n: natural): natural = SUM [0..n] FUNCTION fac(n: natural): natural = PRODUCT [1..n] Malcolm -- Did you check the web site (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
It should be pointed out that the problem of summing the first n natural numbers is isomorphic to that of finding the factorial of n. Compare these two functions FUNCTION sum(n: natural): natural = IF n = 0 THEN 0 ELSE n + sum(n - 1) FUNCTION fac(n: (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  mindstorms - motors and stuff
 
Just wondering - I've seen people hook up 2 motors to a port - how many is it safe to use? How much current can this thing supply? Can it drive the old-style 9V motors? (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Would-be hacker queries. (fwd)
 
(...) That is a rather limited version of recursion, which does not, in general, require f(n-1) to evaluate f(n). What you have described is actually (a subset of) partial recursion, which is provably incomplete (i.e. cannot implement some (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
(...) int sum(int n) { return n*(n-1)/2; } A degenerate recursive algorithm, of course. 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 (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
It should be pointed out that the problem of summing the first n natural numbers is isomorphic to that of finding the factorial of n. Compare these two functions FUNCTION sum(n: natural): natural = IF n = 0 THEN 0 ELSE n + sum(n - 1) FUNCTION fac(n: (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Scheme (fwd)
 
----- Forwarded message from Ralph M. Deal ----- Date: Wed, 12 May 1999 01:52:41 -0400 (EDT) From: "Ralph M. Deal" <deal@kzoo.edu> Subject: Re: Scheme (fwd) (...) Can you furnish a source for MSWLogo? On what platforms does it run? ----- End of (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Fishing for a tasty linkage/gearing/robotic building thread...
 
(...) I totally agree about needing a new building thread. It seems like there is a lot of effort for software in a box with only three inputs and three outputs. Whatever turns you on I suppose. We all get enjoyment from this product in different (...) (28 years ago, 12-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