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 / 4986 (+20)
  RE: Would-be hacker queries.
 
(...) You are right, but recursion carries a terrible price in terms of stack usage. Most recursion is useful for implementing search and traversal algorithms, but unless the hardware supports DEEP stacks for the worst case, the problem is almost (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries.
 
It's too bad that recursion pays the price of stack usage. Recursion is almost always a more elegant solution and is more easily maintained. But as it is, recursion should only be used when you know that the worst case scenario won't overflow the (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: Would-be hacker queries. / Re: Request for new list
 
Ah, er, right. I forgot that bit. I was sorta in a hurry to get to class and I didn't elaborate my example. My bad. You're quite right. (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  FW: Forward of pbFORTH debug sessions
 
-----Original Message----- From: news-gateway@lugnet.com [mailto:news-gateway...ugnet.com] On Behalf Of Ralph Hempel Sent: Tuesday, May 11, 1999 12:36 PM To: lugnet.robotics.rcx....lugnet.com Subject: Forward of pbFORTH debug sessions John Cooper (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: Scheme
 
It strikes me that Scheme is largely an academic language. Granted, there are a few Scheme devotees out there who worship the language, but they seem to be all at MIT or Rice. I think they've even written modules for web programming with Scheme, but (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries. (fwd)
 
----- Forwarded message from Joel Shafer ----- Date: Tue, 11 May 1999 10:50:14 -0500 From: Joel Shafer <joel@connect.net> Subject: RE: Would-be hacker queries. Searching and replacing is a good example of recursion. Suppose that you are editing a (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries. (fwd)
 
I'm afraid you are wrong. That is exactly what it does. The result of the first replacement is dependent on the result of the second replacement which is dependant on the result of the third replacement ... It is exactly like the factorial example (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  RE: Would-be hacker queries. (fwd)
 
----- Forwarded message from Joel Shafer ----- Date: Tue, 11 May 1999 12:24:13 -0500 From: Joel Shafer <joel@connect.net> Subject: RE: Would-be hacker queries. (fwd) I'm afraid you are wrong. That is exactly what it does. The result of the first (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: Would-be hacker queries.
 
(...) The factorial is useful for probability. The factorial is a simple, understandable example of recursion, useful to teach the concept; it is lacking only in that it is not very efficient. But when you are first learning, I think concepts are (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  Re: Would-be hacker queries.
 
(...) You know, a 'bot that actually solves a Towers of Hanoi puzzle with real plates and whatnot would be a pretty cool challenge on hardware like the RCX. (ponder, ponder, ponder)... I don't think it's possible with anything less than LegOS or (...) (28 years ago, 11-May-99, to lugnet.robotics)
 
  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)

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

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