09-05-2026, 09:28 PM
Where Did Combinators Come From? Hunting the Story of Moses Schönfinkel
Author: Stephen Wolfram
Submitted: 18 August 2021
Field: History of Mathematics / Mathematical Logic / Foundations of Computation
arXiv: 2108.08707 (arXiv)
Stephen Wolfram’s article is a historical investigation of Moses Schönfinkel (1888–?), the mathematician who introduced combinators in a lecture to the Göttingen Mathematical Society on 7 December 1920. Wolfram argues that Schönfinkel’s work deserves a much more prominent place in the history of computation: sixteen years before Turing machines, Schönfinkel developed a formal system in which arbitrary functions could, in principle, be represented by combinations of a tiny number of primitive operations. His ideas appeared in the 1924 paper Über die Bausteine der mathematischen Logik (“On the Building Blocks of Mathematical Logic”). The essential primitives are what are now called the $S$ and $K$ combinators, which may be written as
$Kxy=x$
and
$Sxyz=xz(yz)$.
From combinations of these extraordinarily simple rules one can construct general computations without introducing explicitly named variables. Wolfram therefore characterizes Schönfinkel’s system as an exceptionally early—and strikingly minimal—formalism for what we now understand as universal computation.
Much of the paper reconstructs Schönfinkel’s almost-lost biography from archival material. Born in Ekaterinoslav, now Dnipro, in 1888, Schönfinkel studied mathematics at Odessa and later went to Göttingen, where he was connected with the intellectual circle surrounding David Hilbert and Paul Bernays. He helped prepare notes for Hilbert’s 1920 lectures on mathematical logic and presented his revolutionary combinator ideas later that year. Yet his academic career never developed conventionally. In 1924 he left Göttingen for Moscow; after that, reliable information becomes scarce. Contemporary reports claimed that he became mentally ill and entered a sanatorium, while later stories said that he died impoverished around 1940–42, but Wolfram emphasizes that much of this remains uncertain and is supported largely by indirect testimony rather than definitive records.
The larger theme is how an extraordinarily important idea can almost disappear from intellectual history. Haskell Curry encountered Schönfinkel’s work in 1927 and subsequently developed combinatory logic much further, while lambda calculus and Turing machines eventually became much better-known foundations for computation. Schönfinkel’s original paper largely vanished from attention until it was republished in English in Jean van Heijenoort’s influential 1967 collection From Frege to Gödel. Wolfram argues that Schönfinkel’s achievement was especially remarkable because he identified the essential structure of computation before computers existed and before “computation” itself had become a clearly articulated mathematical concept. In this sense, the whole intellectual legacy of an almost forgotten mathematician became compressed into two tiny symbols: $S$ and $K$.
Key takeaways
ARTICLE [PDF]
Author: Stephen Wolfram
Submitted: 18 August 2021
Field: History of Mathematics / Mathematical Logic / Foundations of Computation
arXiv: 2108.08707 (arXiv)
Stephen Wolfram’s article is a historical investigation of Moses Schönfinkel (1888–?), the mathematician who introduced combinators in a lecture to the Göttingen Mathematical Society on 7 December 1920. Wolfram argues that Schönfinkel’s work deserves a much more prominent place in the history of computation: sixteen years before Turing machines, Schönfinkel developed a formal system in which arbitrary functions could, in principle, be represented by combinations of a tiny number of primitive operations. His ideas appeared in the 1924 paper Über die Bausteine der mathematischen Logik (“On the Building Blocks of Mathematical Logic”). The essential primitives are what are now called the $S$ and $K$ combinators, which may be written as
$Kxy=x$
and
$Sxyz=xz(yz)$.
From combinations of these extraordinarily simple rules one can construct general computations without introducing explicitly named variables. Wolfram therefore characterizes Schönfinkel’s system as an exceptionally early—and strikingly minimal—formalism for what we now understand as universal computation.
Much of the paper reconstructs Schönfinkel’s almost-lost biography from archival material. Born in Ekaterinoslav, now Dnipro, in 1888, Schönfinkel studied mathematics at Odessa and later went to Göttingen, where he was connected with the intellectual circle surrounding David Hilbert and Paul Bernays. He helped prepare notes for Hilbert’s 1920 lectures on mathematical logic and presented his revolutionary combinator ideas later that year. Yet his academic career never developed conventionally. In 1924 he left Göttingen for Moscow; after that, reliable information becomes scarce. Contemporary reports claimed that he became mentally ill and entered a sanatorium, while later stories said that he died impoverished around 1940–42, but Wolfram emphasizes that much of this remains uncertain and is supported largely by indirect testimony rather than definitive records.
The larger theme is how an extraordinarily important idea can almost disappear from intellectual history. Haskell Curry encountered Schönfinkel’s work in 1927 and subsequently developed combinatory logic much further, while lambda calculus and Turing machines eventually became much better-known foundations for computation. Schönfinkel’s original paper largely vanished from attention until it was republished in English in Jean van Heijenoort’s influential 1967 collection From Frege to Gödel. Wolfram argues that Schönfinkel’s achievement was especially remarkable because he identified the essential structure of computation before computers existed and before “computation” itself had become a clearly articulated mathematical concept. In this sense, the whole intellectual legacy of an almost forgotten mathematician became compressed into two tiny symbols: $S$ and $K$.
Key takeaways
- Schönfinkel anticipated fundamental ideas of theoretical computer science in 1920, long before Turing machines and modern programming languages.
- The combinators $S$ and $K$ show that extremely simple symbolic transformation rules can generate arbitrarily complex computations.
- His work became the foundation of combinatory logic and is closely related to lambda calculus, functional programming, and ideas such as currying.
- Wolfram’s paper is as much a piece of mathematical detective work as mathematics: it reconstructs the life of a nearly forgotten figure whose ideas became fundamental to our modern conception of computation.
ARTICLE [PDF]
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘