Final answer:
The statement is true because recursive solutions can consume significant computer resources, including memory and computational overhead, which can lead to a stack overflow if not managed properly.
Step-by-step explanation:
The statement is true. Recursive solutions can indeed involve heavy usage of a computer's limited resources, particularly memory. This is because each function call requires space on the call stack, and if the recursion is too deep or not properly managed, it can lead to a condition known as a stack overflow. Furthermore, each call often involves additional computational overhead. For example, sorting algorithms like quicksort and mergesort use recursion and can perform well if implemented carefully, but they can also consume significant resources with large or complex datasets.