 | | Re: Would-be hacker queries. (fwd)
|
|
(...) That is a rather limited version of recursion, which does not, in general, require f(n-1) to evaluate f(n). What you have described is actually (a subset of) partial recursion, which is provably incomplete (i.e. cannot implement some (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test...
|
|
(...) int sum(int n) { return n*(n-1)/2; } A degenerate recursive algorithm, of course. Cheers, Ben. -- (URL) grandfather once told me that there are two kinds of people: those who work and those who take the credit. He told me to try to be in the (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: A recursion question/test...
|
|
It should be pointed out that the problem of summing the first n natural numbers is isomorphic to that of finding the factorial of n. Compare these two functions FUNCTION sum(n: natural): natural = IF n = 0 THEN 0 ELSE n + sum(n - 1) FUNCTION fac(n: (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: Scheme (fwd)
|
|
----- Forwarded message from Ralph M. Deal ----- Date: Wed, 12 May 1999 01:52:41 -0400 (EDT) From: "Ralph M. Deal" <deal@kzoo.edu> Subject: Re: Scheme (fwd) (...) Can you furnish a source for MSWLogo? On what platforms does it run? ----- End of (...) (28 years ago, 12-May-99, to lugnet.robotics)
|
| |
 | | Re: Fishing for a tasty linkage/gearing/robotic building thread...
|
|
(...) I totally agree about needing a new building thread. It seems like there is a lot of effort for software in a box with only three inputs and three outputs. Whatever turns you on I suppose. We all get enjoyment from this product in different (...) (28 years ago, 12-May-99, to lugnet.robotics)
|