On Universality of the S Combinator
Computational Complexity
2022-10-26 v1 Discrete Mathematics
Formal Languages and Automata Theory
Combinatorics
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?''
Cite
@article{arxiv.2210.12893,
title = {On Universality of the S Combinator},
author = {Farrokh Vatan},
journal= {arXiv preprint arXiv:2210.12893},
year = {2022}
}