Comments by "Tiago D\x27Agostini" (@tiagodagostini) on "Math in the Simpsons: Apu's paradox" video.

  1.  @thomasholden500  Yet that is a lie. Recursion is SLOWER for solving most functions that can be expressed non recursively, that because there is overhead of the running system since the stack grows and that cost memory and that result in less cache coherence.
    2