Continuing our lambda calculus series is this finale on SKI combinators. Tiger will share with us how to think about booleans in terms of lambda calculus. He will also shed light on Turing completeness, where we'll learn how all the combinators we've talked about can be interpreted by computers.
Speaker
Tiger @t1ger-0527
Dry-run
Nov 23 Follow Up: Nov 30
Intro