[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: to big nest level of recursion
|
From: |
Alan Mackenzie |
|
Subject: |
Re: to big nest level of recursion |
|
Date: |
Sat, 25 Mar 2006 10:30:32 +0000 |
|
User-agent: |
tin/1.4.5-20010409 ("One More Nightmare") (UNIX) (Linux/2.0.35 (i686)) |
David Reitter <david.reitter@gmail.com> wrote on Tue, 21 Mar 2006
21:31:29 +0000:
[ .... ]
> Maybe it's a consolation for you that for every recursive algorithm,
> you can formulate an iterative version. And you don't bloat a call
> stack when you do so.
This is not true. There are algorithms that are intrinsically recursive
and cannot be formulated with mere iteration (such as the Ackermann
function, specially invented to demonstrate this).
--
Alan Mackenzie (Munich, Germany)
Email: aacm@muuc.dee; to decode, wherever there is a repeated letter
(like "aa"), remove half of them (leaving, say, "a").