To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.roboticsOpen lugnet.robotics in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 Robotics / 5087
5086  |  5088
Subject: 
Re: recursion (was RE: Would-be hacker queries.)
Newsgroups: 
lugnet.robotics
Date: 
Thu, 13 May 1999 21:32:57 GMT
Original-From: 
Peter Hesketh <pbh@phesk.demon^stopspammers^.co.uk>
Viewed: 
1235 times
  
In article <373AA2D3.2A4E812B@algroup.co.uk>, Ben Laurie
<ben@algroup.co.uk> writes

I seem to remember the point of the Ackermann function is that the
amount of computation required to evaluate it explodes very rapidly with
small changes in parameter values, and it is recursive and rather

Is this the same Mr Ackerman who invented Ackerman steering?
--
Regards - Peter Hesketh, Mynyddbach, Mon.
Forty reasons why a dog is better than a woman: number 44
"A dog doesn't tell you you need a haircut."
That's the lot, folks: the complete set is available from
http://www.phesk.demon.co.uk/dg1-44.zip
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics



Message is in Reply To:
  Re: recursion (was RE: Would-be hacker queries.)
 
(...) I seem to remember the point of the Ackermann function is that the amount of computation required to evaluate it explodes very rapidly with small changes in parameter values, and it is recursive and rather simple. I also seem to remember "so (...) (25 years ago, 13-May-99, to lugnet.robotics)

21 Messages in This Thread:






Entire Thread on One Page:
Nested:  All | Brief | Compact | Dots
Linear:  All | Brief | Compact
    

Custom Search

©2005 LUGNET. All rights reserved. - hosted by steinbruch.info GbR