Turing famously showed that computers can’t decide whether your code halts. But in 1951, Henry Rice proved a much more devastating result: “computers can’t decide anything interesting about your code’s input-output!”

A new chapter of busy-beavers on tigyog!

Very nice and simply explained theoretical computer science theorems!

A nice intro to BCKW and SKI combinator. The most interesting part I found is how dropping some of the combinator gives a different computing world like linear logic. I never thought of that before. Maybe some combinator system reveals a more fundamental picture of computing.