Performance impact of increased recursion on harder tasks
Determine whether increasing recursion depth (via larger T or n) improves performance on harder problems and characterize the associated computational trade-offs in speed and memory.
References
More recursions could be helpful for harder problems (we have not tested it, given our limited resources); however, increasing either T or n incurs massive slowdowns.
— Less is More: Recursive Reasoning with Tiny Networks
(Jolicoeur-Martineau, 6 Oct 2025) in Section “Optimal the number of recursions”