Final answer:
A large number of recursive function calls can lead to a stack overflow and crash the program by running out of memory. Ensuring a proper base case and applying optimizations like tail recursion can help mitigate this risk.
Step-by-step explanation:
True, a large number of recursive function calls can indeed result in a crash due to running out of memory. This phenomenon is known as a stack overflow. Each time a recursive function calls itself, a new frame is added to the call stack which contains information such as the local variables and the return address. If the recursion is too deep and the call stack exceeds the size limit that the system can handle, it causes a stack overflow, leading to a program crash.
In general, recursive functions should have a well-defined base case to ensure that the recursion terminates. Also, optimizations such as tail recursion, where the recursive call is the last operation in the function, can sometimes be optimized by the compiler to prevent additional stack frames from being created, thus preventing a stack overflow in some cases.