## Revisiting the transfinite combinator calculus

A problem I may need to rectract the results of the previous blog post because the transfinitary combinator calculus is way too strong. Let’s take a certain combinator. This maps an ordered pair \((a,b)\) where \(b\) is a representation of true or false and \(a\) is a representation of a Turing machine state. The combinator […]

Revisiting the transfinite combinator calculus Read More »