What does a Romanesco have to do with recursion?
In computer science, recursion refers to a function that calls itself. According to Wikipedia, it is “a basically infinite process that contains itself as a part or can be defined with the help of itself.” Other keywords are Mandelbrot set or apple man.
Recursion also exists in nature! The algorithm for “building” a Romanesco could also be described as a function that calls itself as a function: A Romanesco consists of small Romanescos, which consist of smaller Romanescos, which consist of even smaller Romanescos, which (etc.) .
