Author Archives: Mikhail Bernadsky

SKIing with Y*, Iota and Ackermann

(Source code for this post is here: ) There are only six atomic operations for Turing machines – read and write to the tape, move the tape left or right one square,  change state based on the observed symbol and halt. Yet, it’s not hard to see, at least at a high level, how a program in… Read More »