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 / 4996 (+20)
  Re: Would-be hacker queries.
 
In article <37389556.ACC65587@lynx.bc.ca>, Mark Tarrabain <markt@lynx.bc.ca> writes (...) I saw one of the early pumas playing hanoi at an exhibition. It must be arout 30 years ago - it's been done before. (28 years ago, 11-May-99, to lugnet.robotics)
 
  Fishing for a tasty linkage/gearing/robotic building thread...
 
Hi all, I've noticed that it's been awhile since there has been good thread concerning the building of robotic elements in Lego. I have nothing against the really neat conversations concerning the RCX - but- computers are what I do for a living, so (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries.
 
(...) Don't modern implementations of Lisp/Scheme/Logo automatically convert tail- recursion into iteration? --Todd (28 years ago, 11-May-99, to lugnet.robotics)
 
  recursion (was RE: Would-be hacker queries.)
 
Here is an interesting article on implementing stack free recursion. (...) -- Did you check the web site first?: (URL) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries.
 
(...) Yes, as do decent implementations of traditional compiled languages. For example, GCC converts the following: int f(int v) { if(v<2) return v; return f(v-1); } into int f(int v) { while(v>1) { v--; } return v; } Not terribly useful, but (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: recursion (was RE: Would-be hacker queries.)
 
Hi, Important clarification: "data stack" free recursion. This is an important significance. It's really only useful for systems with no data stack.... or alternately as an interesting conversation piece. What's usually more clever is using data (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: recursion (was RE: Would-be hacker queries.)
 
(...) Actually, he goes on to show that in some cases you can eliminate call stack recursion using simple transforms as well. (...) For example, JVM does this by keeping a frame stack of methods that have been executed. The interpreter main loop (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: recursion (was RE: Would-be hacker queries.)
 
(...) Let me say that I have not looked at the algorythm in question, yet, so forgive me if this is their solution... (...) The SmalltalkVM my last company built used much the same idea, however, one might say that it was a truely recursive (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
(define (sum num) (if (zero? num) 0 (+ num(sum (- num 1))))) -- Richard Clemens Associate Professor Computer Science Department West Virginia Wesleyan College Buckhannon, West Virginia 26201 clemens@wvwc.edu 304.473.8421 ----- Original Message ----- (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
(...) Well, you didn't specify if the numbers existed in a list or were iterative, and you didn't specify language so: Smalltalk: ^list sum. or ^(1..n) sum. sorry.. if you'll excuse Perl... List: foreach $num (@list) {$result += $num;} return (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Scheme
 
A simple scheme interface such as (sensor <num> <type> <mode>) or (motor <letter> <direction> <speed>) could prove a valuable addition to scheme teaching functions. Students could explore functions (i.e. just small "programs") to include the ability (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test... (fwd)
 
(...) Make that 'numbers' into 'positive integers' and it'll make more sense perhaps. (...) It's recursive, the only number you know is n. Language is really irrelevant. I asked for an algorithm. I'll give you a hint, it consists of two sentences (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries. (fwd)
 
----- Forwarded message from Joel Shafer ----- Date: Tue, 11 May 1999 11:53:27 -0500 From: Joel Shafer <joel@connect.net> Subject: RE: Would-be hacker queries. It's too bad that recursion pays the price of stack usage. Recursion is almost always a (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: Scheme (fwd)
 
----- Forwarded message from Rich Clemens ----- From: "Rich Clemens" <clemens@wvwc.edu> Subject: Re: Scheme Date: Tue, 11 May 1999 23:26:18 -0400 A simple scheme interface such as (sensor <num> <type> <mode>) or (motor <letter> <direction> <speed>) (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test... (fwd)
 
----- Forwarded message from Rich Clemens ----- From: "Rich Clemens" <clemens@wvwc.edu> Subject: Re: A recursion question/test... Date: Tue, 11 May 1999 23:51:21 -0400 (define (sum num) (if (zero? num) 0 (+ num(sum (- num 1))))) ----- End of (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  RE: cursion (was RE: Would-be hacker queries.)
 
I hate to be pedantic, but what you're describing is functional composition. The key to recursion is that the function calls itself. e.g. int factorial(int n) // assumes n > 0 { if (n > 1) return n * factorial( n - 1); // the recursive call, this is (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  A recursion question/test...
 
Hi, With all the discussion on understanding recursion and such for programmers I thought I'd share a little problem I find enlightening.... Describe as simple a recursive algorithm as possible for summing the first n numbers. ___...___ Three step (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
(...) d'oh. my ($n)=@ARGV; my $result=$n; $result += $n while($n--); print $result."\n"; What a difference a compile makes... but it's still not very recursive. I'll be interested in seeing your answer. Aloha, JR - - - - - - - - - - JR Conlin (...) (28 years ago, 12-May-99, to lugnet.robotics)
 
  Re: A recursion question/test...
 
Jim Choate poses the problem: (...) What other than sum(n) = n + sum(n-1) (with proper termination conditions, of course - sum(1) = 1). Ralph deal@kzoo.edu -- Did you check the web site first?: (URL) (28 years ago, 12-May-99, to lugnet.robotics)
 
  You know, all this computer science talk doesn't really belong here.
 
Try lugnet.off-topic.geek. :) (...) (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