February 26, 2026
S is for Spicy
The Wolfram S Combinator Challenge
One-letter math bet ignites hype, skepticism, and a tiny prize
TLDR: Wolfram launched a challenge to prove whether a single “S” function can do everything a computer can, and the internet erupted. Commenters mocked the small prize, hyped world-changing stakes, and argued that math likely blocks S-alone—turning a century-old idea into today’s hottest nerd fight.
Stephen Wolfram just tossed a brain-bending gauntlet: can a single tiny math function—the “S” from the classic S and K combinators invented in 1920—do everything a computer can? The challenge: prove it true or false. The crowd reaction: part popcorn, part pitchforks.
The loudest clapback came from wallet-watchers like browningstreet, who quipped the glossy site “cost more than the prize,” while hype-hawks like bingobangobungo gasped that if this is real, it could “revolutionize computing,” so why the bargain-bin bounty? Meanwhile, the math squad rolled in with receipts: jmj says S “always duplicates” and never deletes—translation: that’s why the K piece matters—dropping a proof-by-induction vibe and a pointer to deep theory. Others brought homework, like fritzo citing a 2022 chapter on the S-only world, for anyone brave enough to dive.
Then came the meme energy: one commenter dismissed it as “More wolf-slop,” and another asked “What’s the endgame?”—a nod to the feeling this might be more show than substance. Between citations, skepticism, and side-eye at the prize money, the thread turned into a cage match of hype vs. hard math. Verdict so far: the idea is wild, the comments are wilder, and the prize may be the smallest thing in the room.
Key Points
- •Moses Schönfinkel defined the S and K combinators on December 7, 1920.
- •S and K together are known to be computation universal.
- •On December 7, 2020, Stephen Wolfram suggested the S combinator alone might be universal.
- •The article announces a challenge to prove or disprove Wolfram’s conjecture.
- •The challenge seeks formal evidence confirming or refuting the universality of S without K.