On 18 Set, 18:51, Grant Edwards <[EMAIL PROTECTED]> wrote: > Perhaps Lorenzo Stella is referring to Python's lack of > tail-recursion optimization? There are languages that > guarantee unlimited tail-recursion with a limited stack.
That's it. Rustom Mody: your implementation lacks exactly where mine does. Try listing the first 2000 primes... That's what I meant: I cannot in general (with Python) get such list just by defining *what* it is, I have to express *how* to get it (describing an algorithm). "What" or "How": that is the question. Steve Holden wrote: > You just don't like the specific limit that Python imposes. So increase > it with sys.setrecursionlimit(). That is obviously not the answer to my question. -- http://mail.python.org/mailman/listinfo/python-list
