 | | 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)
|
| |
 | | 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.
|
|
(...) 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. (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. (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 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: 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)
|
| |
 | | 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: 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)
|
| |
 | | 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)
|