 | | RE: Would-be hacker queries. / Re: Request for new list —Blake Winton
|
| | | (...) combining (...) You might want to add the recursive part of this example (namely 6! = 6*(5!), and 5! = 5*(4!), and so on, until you get 1!, which is equal to 1. Then you travel back up the chain, multiplying as you go). Later, Blake. -- Did (...) (26 years ago, 10-May-99, to lugnet.robotics)
|
| | | |
| | | | | Scheme —Rich Clemens
|
| | | | | Anyone consider scheme as a "language" to drive RCX? -- Richard Clemens Associate Professor Computer Science Department West Virginia Wesleyan College Buckhannon, West Virginia 26201 clemens@wvwc.edu 304.473.8421 -- Did you check the web site (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | |
| | | | | RE: Would-be hacker queries. —JR Conlin
|
| | | | | (...) problem. (...) You know, I have never really liked the factorial example of recursion. Honestly, how many times have you really needed to generate a factorial in general experience? I feel a better example is building stuff with LEGO. In this (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | |
| | | | | | | Re: Would-be hacker queries. —Kekoa Proudfoot
|
| | | | | | (...) 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 (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | | |
| | | | | | | | Re: Would-be hacker queries. —Mark Tarrabain
|
| | | | | | (...) 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 (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | | |
| | | | | | | | Re: Would-be hacker queries. —Peter Hesketh
|
| | | | | | 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. (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | | |
| | | | | Re: Scheme —Joel Shafer
|
| | | | | Could you give a brief description of scheme? I've heard that it is a fairly high level language and I know that a compiler or interpreter exists for it on linux. (...) -- Did you check the web site first?: (URL) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | |
| | | | | | | Re: Scheme —Alex Wetmore
|
| | | | | | From: Joel Shafer <joel@connect.net> (...) exists (...) (URL) my view Scheme is the most useful subset of lisp, designed to make a small, elegant, functional language. This is compared to Common Lisp, which is kind of a superset of the various (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | | |
| | | | | | | | Re: Scheme —Eric Lind
|
| | | | | | 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 (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | | | |
| | | | | | | | Re: Scheme —Rich Clemens
|
| | | | | | 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 (...) (26 years ago, 12-May-99, to lugnet.robotics)
|
| | | | | | |
| | | | | Re: Would-be hacker queries. / Re: Request for new list —Eric Lind
|
| | | | 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. (...) (26 years ago, 11-May-99, to lugnet.robotics)
|
| | | | |
