Mark Dickinson added the comment:
The recursion limit exists precisely so that Python can avoid overflowing
the C stack and hence crashing. So if you increase the recursion limit
without also increasing the stack space assigned to the process, you
should expect a crash.
Closing as won't fix
New submission from ttsiod :
I found a nice yield-based implementation of the sieve of Eratosthenes.
I tried to find the last prime number less than 1.000.000 (1M) - so I
had to increase the recursion limit (via sys.setrecursionlimit).
It seemed to work - but after running for about 3 minutes,
