Comment Comment by ignoranceprior There are actually single combinators which form a complete basis, i.e. from which you can get S and K, and thereby universal computation.https://en.wikipedia.org/wiki/Combinatory_logic#One-point_ba...https://en.wikipedia.org/wiki/Iota_and_Jot#Universal_iota parent ignoranceprior 6 years ago
https://en.wikipedia.org/wiki/Combinatory_logic#One-point_ba...
https://en.wikipedia.org/wiki/Iota_and_Jot#Universal_iota