Structural induction... with cake

By Caroline Liu

'BUT CAKE NEEDS NO PROOF!', cries Team Cake.

Structural induction is a way of proving something is true, for everything in a set. You can use it to prove mathematical equations, things about Fibonacci numbers, or the efficiency of programs. That’s all fine and dandy, but I’d much rather prove how tasty cake is for now.

Fetching comments...