Logic in computer science | Lambda calculus | Combinatory logic
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of computation and also as a basis for the design of functional programming languages. It is based on combinators, which were introduced by Schönfinkel in 1920 with the idea of providing an analogous way to build up functions—and to remove any mention of variables—particularly in predicate logic. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments. (Wikipedia).
Introduction to Combinatory Logic – #SoME2
This is Alexander Farrugia's and Giorgio Grigolo's submission to the second 3blue1brown Summer of Math Exposition. #some2 #mathematics #combinators #logic Music: Icelandic Arpeggios – DivKid
From playlist Summer of Math Exposition 2 videos
Combinatorial Identities via both Algebraic and Combinatorial Proof [Discrete Math Class]
This video is not like my normal uploads. This is a supplemental video from one of my courses that I made in case students had to quarantine. This is a follow up to previous a video introducing combinatorial objects (in particular k-permutations and k-subsets) and a video about the sum and
From playlist Discrete Mathematics Course
Pablo Shmerkin: Additive combinatorics methods in fractal geometry - lecture 1
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics
Peter Varju: Additive combinatorics methods in fractal geometry - lecture 2
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics
Paul-André Melliès - A gentle introduction to template games and linear logic
Game semantics is the art of interpreting formulas (or types) as games and proofs (or programs) as strategies. In order to reflect the interactive behaviour of pro- grams, strategies are required to follow specific scheduling policies. Typically, in the case of a sequential programming lan
From playlist Combinatorics and Arithmetic for Physics: Special Days 2022
Peter Varju: Additive combinatorics methods in fractal geometry - lecture 1
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics
Wolfram Physics Project: Working Session Tuesday, Mar. 16, 2021 [Bibliographying Combinators]
This is a Wolfram Physics Project working session on bibliographying combinators. Begins at 4:33 Originally livestreamed at: https://twitch.tv/stephen_wolfram Stay up-to-date on this project by visiting our website: http://wolfr.am/physics Check out the announcement post: http://wolfr.am
From playlist Wolfram Physics Project Livestream Archive
Live CEOing Ep 410: Language Design in Wolfram Language [Combinators]
In this episode of Live CEOing, Stephen Wolfram reviews the design of some upcoming functionality for the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen W
From playlist Behind the Scenes in Real-Life Software Design
Michel Rigo: From combinatorial games to shape-symmetric morphisms
Abstract: The general aim of these lectures is to present some interplay between combinatorial game theory (CGT) and combinatorics on (multidimensional) words. In the first introductory lecture, we present some basic concepts from combinatorial game theory (positions of a game, Nim-sum, Sp
From playlist Combinatorics
NOTACON 5: CPU Not Required: Making Demos with FPGAs
Speaker: Jeri Ellsworth In the endless battle to make your demo quicker, more impressive and yet still balance the changes in CPU, a whole other way of approaching this situation exists: FPGAs. Short for Field-Programmable Gate Arrays, this dedicated hardware, well-documented and fun to p
From playlist Notacon 5
EEVacademy #7 - Designing Combinatorial Digital Logic Circuits
How do you convert a logic truth table into a digital logic circuit? Dave shows you how with the Sum Of Products method. Forum: http://www.eevblog.com/forum/blog/eevacademy-7-designing-combinatorial-digital-logic-circuits/ EEVblog Main Web Site: http://www.eevblog.com The 2nd EEVblog Chan
From playlist EEVacademy
Live CEOing Ep 389: Language Design in Wolfram Language [Combinators & AxiomaticTheory]
In this episode of Live CEOing, Stephen Wolfram reviews the design of Combinators for the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen Wolfram here: htt
From playlist Behind the Scenes in Real-Life Software Design
7. The Importance of Development in Evolution
Principles of Evolution, Ecology and Behavior (EEB 122) Development is responsible for the complexity of multicellular organisms. It helps to map the genotype into the phenotype expressed by the organism. Development is responsible for ancient patterns among related organisms, and many
From playlist Evolution, Ecology and Behavior with Stephen C. Stearns
Josef Urban - Some News from the Semantic AI Paradise
The talk will make a (doomed?) attempt to convince the physicists in the audience that machine-based logic and proof combined with machine-based learning is a creeping revolution in science threatening their job security. In principle, I would like to ground it in at least some examples an
From playlist Mikefest: A conference in honor of Michael Douglas' 60th birthday
Model theory and combinatorics of finite fields - Alexis Chevalier
Short Talks by Postdoctoral Members Topic: Model theory and combinatorics of finite fields Speaker: Alexis Chevalier Affiliation: Member, School of Mathematics Date: September 21, 2022
From playlist Mathematics
Choosing From A Negative Number Of Things?? #SoME2
Combinatorial Reciprocity Theorems by Mattias Beck and Raman Sanyal: https://page.mi.fu-berlin.de/sanyal/teaching/crt/CRT-Book-Online.pdf An introductory look at negative binomial coefficients, and in general, combinatorial reciprocity. First, we explain how to formally justify binomial
From playlist Summer of Math Exposition 2 videos
1. A bridge between graph theory and additive combinatorics
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX In an unsuccessful attempt to prove Fermat's last theorem
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
Pablo Shmerkin: Additive combinatorics methods in fractal geometry - lecture 3
In the last few years ideas from additive combinatorics were applied to problems in fractal geometry and led to progress on some classical problems, particularly on the smoothness of Bernoulli convolutions and other self-similar measures. We will introduce some of these tools from additive
From playlist Combinatorics