For challenges pertaining to Combinatory Logic model of computing.

Combinatory logic is a model of computation closely related to lambda calculus, but using a fixed set of combinators instead of lambda abstraction. The most prominent form of this is SKI (or SK) combinator calculus, which is extensionally equivalent to lambda calculus and therefore is Turing-complete (essentially a Turing tarpit).