2000 character limit reached
On Universality of the S Combinator
Published 24 Oct 2022 in cs.CC, cs.DM, cs.FL, and math.CO | (2210.12893v1)
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?''
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.