A brief and entertaining talk by an obviously excited presenter. 🙂 It goes into the same directions as Jim Weirich’s talk about the Y combinator.
I take my head off to Jim, that’s a great way to approach a weird intersection of mathematics and programming. 😉 For those who are curious … he uses a very simple mathematical algorithm to explore how you can express recursions in Lambda calculus and thus “derives” the Y combinator.
Totally useless, but worth every minute. 😉
This is probably one of the more ingenious ways to explain something like a Möbius strip. 😀
To Hell with π … long live τ. 😉
The way it’s presented, it makes sense: it’s concise, consistent and more intuitive.
There is an awesome demonstration how knowing your maths can help you avoid a traffic penalty.