Combinators and the Story of Computation

02/18/2021
by   Stephen Wolfram, et al.
0

We discuss the role of combinators in the development of the modern conception of computation over the course of the past century. We describe how ideas about formalism and mathematical logic led to the introduction of combinators in 1920 as an extension of the discovery of Nand as a basis for basic logic. We then discuss how combinators informed lambda calculus and symbolic computation, and their relationship to the development of practical computation. We finally describe recent views of combinators in terms of the computational universe of possible programs, and a recent approach to the fundamental theory of physics.

READ FULL TEXT

page 3

page 4

page 29

page 30

page 31

page 33

page 37

page 39

research
03/23/2021

Combinators: A Centennial View

We give a modern computational introduction to the S,K combinators inven...
research
04/04/2019

Towards Specifying Symbolic Computation

Many interesting and useful symbolic computation algorithms manipulate m...
research
04/18/2023

A Neural Lambda Calculus: Neurosymbolic AI meets the foundations of computing and functional programming

Over the last decades, deep neural networks based-models became the domi...
research
04/01/2019

Natural Deduction Assistant (NaDeA)

We present the Natural Deduction Assistant (NaDeA) and discuss its advan...
research
04/18/2020

Three Modern Roles for Logic in AI

We consider three modern roles for logic in artificial intelligence, whi...
research
07/02/2022

Tableless Calculation of Circular Functions on Dyadic Rationals

I would like to tell a story. A story about a beautiful mathematical rel...
research
11/17/2021

Alternative Paradigms of Computation

With Moore's law coming to a close it is useful to look at other forms o...

Please sign up or login with your details

Forgot password? Click here to reset