 | | RE: How is the battery doing?
|
|
(...) You could just format the number to the LCD, maybe when you press a certain combination of buttons on the RCX? Cheers, Ralph Hempel - P.Eng ---...--- The train stops at the train station, The bus stops at the bus station, So why am I sitting (...) (28 years ago, 11-May-99, to lugnet.robotics.rcx.pbforth)
|
| |
 | | Re: zxt614,rue250
|
|
(...) A quick check reveals that a replacement part for the polyswitch fuse is 60R250 (Littelfuse) or the Bourns MF-RX250...I'm sure there are others. If you can't find one of these resettable fuses, you could likely use any 5amp fuse and just (...) (28 years ago, 12-May-99, to lugnet.robotics.handyboard)
|
| |
 | | Minissc 2
|
|
(...) (28 years ago, 12-May-99, to lugnet.robotics.handyboard)
|
| |
 | | Re: How is the battery doing?
|
|
Could do, but I'm using the display to debug the DEFCON code at the moment. (28 years ago, 12-May-99, to lugnet.robotics.rcx.pbforth)
|
| |
 | | 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)
|
| |
 | | Multitasker test script
|
|
John, You might want to try this little script to try out the tasker. It's based on Koh's demo. If you type TASK0 AWAKE and then .TASKS, you will see the chain is ok and that TASK0 is running. Now press the RUN button on the RCX and try .TASKS (...) (28 years ago, 12-May-99, to lugnet.robotics.rcx.pbforth)
|
| |
 | | RE: Multitasker test script
|
|
Previously, I wrote (...) If anyone else out there is tempted to try the pbFORTH tasker, I will email the srec to you. I have not posted it on my website because it is very early beta software. Cheers, Ralph Hempel - P.Eng ---...--- Check out (...) (28 years ago, 12-May-99, to lugnet.robotics.rcx.pbforth)
|
| |
 | | 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)
|
| |
 | | Re: Scheme
|
|
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 (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test... (fwd)
|
|
(...) Make that 'numbers' into 'positive integers' and it'll make more sense perhaps. (...) It's recursive, the only number you know is n. Language is really irrelevant. I asked for an algorithm. I'll give you a hint, it consists of two sentences (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | RE: Would-be hacker queries. (fwd)
|
|
----- Forwarded message from Joel Shafer ----- Date: Tue, 11 May 1999 11:53:27 -0500 From: Joel Shafer <joel@connect.net> Subject: RE: Would-be hacker queries. It's too bad that recursion pays the price of stack usage. Recursion is almost always a (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: Scheme (fwd)
|
|
----- Forwarded message from Rich Clemens ----- From: "Rich Clemens" <clemens@wvwc.edu> Subject: Re: Scheme Date: Tue, 11 May 1999 23:26:18 -0400 A simple scheme interface such as (sensor <num> <type> <mode>) or (motor <letter> <direction> <speed>) (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test... (fwd)
|
|
----- Forwarded message from Rich Clemens ----- From: "Rich Clemens" <clemens@wvwc.edu> Subject: Re: A recursion question/test... Date: Tue, 11 May 1999 23:51:21 -0400 (define (sum num) (if (zero? num) 0 (+ num(sum (- num 1))))) ----- End of (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | RE: cursion (was RE: Would-be hacker queries.)
|
|
I hate to be pedantic, but what you're describing is functional composition. The key to recursion is that the function calls itself. e.g. int factorial(int n) // assumes n > 0 { if (n > 1) return n * factorial( n - 1); // the recursive call, this is (...) (28 years ago, 11-May-99, to lugnet.robotics)
|
| |
 | | A recursion question/test...
|
|
Hi, With all the discussion on understanding recursion and such for programmers I thought I'd share a little problem I find enlightening.... Describe as simple a recursive algorithm as possible for summing the first n numbers. ___...___ Three step (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test...
|
|
(...) d'oh. my ($n)=@ARGV; my $result=$n; $result += $n while($n--); print $result."\n"; What a difference a compile makes... but it's still not very recursive. I'll be interested in seeing your answer. Aloha, JR - - - - - - - - - - JR Conlin (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Unsubscribe
|
|
Please unsubscribe me from the handy board mailing list. Alex Novaes (28 years ago, 12-May-99, to lugnet.robotics.handyboard)
|
| |
 | | Re: A recursion question/test...
|
|
Jim Choate poses the problem: (...) What other than sum(n) = n + sum(n-1) (with proper termination conditions, of course - sum(1) = 1). Ralph deal@kzoo.edu -- Did you check the web site first?: (URL) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | You know, all this computer science talk doesn't really belong here.
|
|
Try lugnet.off-topic.geek. :) (...) (28 years ago, 12-May-99, to lugnet.robotics)
|