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