flâneur

What is PLUS times PLUS? - YouTube

youtube.com · 4,706 words · saved by 2 readers

This video explores lambda calculus, a system for pure computation, using visual diagrams. It demonstrates beta reduction, a process of evaluating lambda expressions, through animated examples. The tutorial covers functions, logic gates, and even recursion using a fixed-point combinator. Follow along using the transcript. This video explores lambda calculus, a system for pure computation, using visual diagrams. It demonstrates beta reduction, a process of evaluating lambda expressions, through animated examples. The tutorial covers functions, logic gates, and even recursion using a fixed-point combinator. Follow along using the transcript.

ERRATA: • The "Church-Turing Thesis" is different from the "Church-Turing Theorem". The "theorem" is the claim which I discussed in the video- namely, that the Turing machine and lambda calculus are equally powerful. The "thesis" is the informal claim that the two of these systems are a sufficient formalization which capture the idea of "arbitrary computation". • I claimed in the end of the video that this was the first example of animated beta-reductions of visual lambda expressions. Paul Brauner has some videos here: https://www.youtube.com/playlist?list=PLi8_XqluS5xc7GL-bgVrxpA2Uww6nK0gV,…

saved by

related reading