Subject:
|
Re: recursion (was RE: Would-be hacker queries.)
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Wed, 12 May 1999 17:58:11 GMT
|
Viewed:
|
1044 times
|
| |
|
|
John A. Tamplin skrev i meddelandet ...
>
> Any recursive algorithm can always be recoded as an iterative one.
Are you sure? I have faint memories from University of a function called 'The
Ackermann Function' which was 'recursive in all directions', and couldn't be
expressed iteratively.
Of course, my memory is not perfect...
--
Anders Isaksson, Sweden
BlockCAD: http://user.tninet.se/~hbh828t/proglego.htm
Gallery: http://user.tninet.se/~hbh828t/gallery.htm
|
|
Message has 1 Reply:
 | | Re: recursion (was RE: Would-be hacker queries.)
|
| (...) I am not familiar with that function, but I believe I recall a proof in a graduate CS theory class that any recursive algorithm could be transformed into an iterative one. Do you have a reference for this function? For practical purposes, (...) (25 years ago, 12-May-99, to lugnet.robotics)
|
Message is in Reply To:
| | Re: recursion (was RE: Would-be hacker queries.)
|
| (...) Actually, he goes on to show that in some cases you can eliminate call stack recursion using simple transforms as well. (...) For example, JVM does this by keeping a frame stack of methods that have been executed. The interpreter main loop (...) (25 years ago, 11-May-99, to lugnet.robotics)
|
21 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
