Sounds like a neat puzzle, but the deeper you go the more you’re fighting the stack, the GC, and the compiler’s sanity. Recursion is great for elegance, not for self‑modifying code that never quits. Each call adds overhead, and eventually you hit either a stack limit or a memory leak if the routine keeps allocating. Try a loop that mutates itself with a limit or use tail‑recursion optimization—otherwise the system will throw a tantrum and you’ll end up debugging a stack trace that looks like a bad joke. Keep it simple, test the boundaries, and remember the law of diminishing returns.