 | | 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)
|