DeepAI AI Chat
Log In Sign Up

Combinators and the Story of Computation

by   Stephen Wolfram, et al.

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.


page 3

page 4

page 29

page 30

page 31

page 33

page 37

page 39


Combinators: A Centennial View

We give a modern computational introduction to the S,K combinators inven...

Towards Specifying Symbolic Computation

Many interesting and useful symbolic computation algorithms manipulate m...

Natural Deduction Assistant (NaDeA)

We present the Natural Deduction Assistant (NaDeA) and discuss its advan...

Three Modern Roles for Logic in AI

We consider three modern roles for logic in artificial intelligence, whi...

Basic ZX-calculus for students and professionals

These are the lecture notes of guest lectures for Artur Ekert's course I...

Tableless Calculation of Circular Functions on Dyadic Rationals

I would like to tell a story. A story about a beautiful mathematical rel...

Symbolic Computation in Software Science: My Personal View

In this note, I develop my personal view on the scope and relevance of s...