The Wolfram S Combinator Challenge
Summary
Promotes exploration of whether the S combinator alone can achieve universal computation, with a $20,000 prize for a rigorous proof or refutation. The page outlines background on combinators, submission requirements, eligibility, and the adjudication process, including potential publication of a successful solution.