On Universality of the S Combinator
Abstract
In combinatory logic it is known that the set of two combinators K and S are universal; in the sense that any other combinator can be expressed in terms of these two. K combinator can not be expressed only in terms of the S combinator. This will answer a question raised by Stephen Wolfram as ``Is the S combinator on its own computation universal?''
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.