Where Did Combinators Come From? Hunting the Story of Moses Schönfinkel
I&#x27;ve given an 101 minutes trying really hard to grok this... everything I&#x27;ve found skips the very basic definition of what S and K are for some astoundingly dumb reason.<p>Stephen Wolfram obviously knows what he&#x27;s talking about... but lacks Feynman&#x27;s ability to put it into layman&#x27;s terms.<p>My suspicion is that there is an implied list, and if you go off the end of the list, you get a hidden zero... if not, you get a one.<p>The SKI combinator Wikipedia page has a section about Boolean logic that comes close to making sense to me.<p>Please let me know if I&#x27;m getting this right.... restating the page, putting it into familiar notation<p>Booleans are a list of [1,0]<p>T(x,y) = x<p>F(x,y) = y<p>Applying this over Booleans<p>T(1,0) --&gt; 1<p>F(1,0) --&gt; 0<p>They then go to explain that<p>T(x,y) = K combinator<p>Then they go on to explain<p>False(x,y) = SK, which I think is K(S(Boolean)<p>It&#x27;s at this point, I&#x27;m lost.<p>Is SK --&gt;   S(K(xy)) or K(S(xy))<p>I can&#x27;t resolve that to get any further.