What is PLUS times PLUS?

Опис:

In this video, the creator discusses the Church‑Turing Thesis and Theorem, clarifying that the theorem states the equivalence of Turing machines and lambda calculus, while the thesis is an informal claim about arbitrary computation. They also mention that this is the first example of animated beta‑reductions of visual lambda expressions, though they note that Paul Brauner’s videos do not explicitly animate the mechanics of one step of beta‑reduction. The video touches on how Lisp and Rust blur the line between functional and imperative programming, and the creator advises taking the chart at the end with a grain of salt. Additionally, they explain that the expression (*(+ +)) can be treated as a 3‑argument function, reducing to (c^b)*(a+c). At 4:28, a number of visualizations for the Lambda Calculus were shown, including David C Keenan’s Graphical Notation, Robin Piedeleu’s notation, de Bruijn indices, Vex, and Visual Lambda Calculus.