Pathway XXVII

λTuring machines

A tape, a head, a finite table of rules. Recursive functions are what the machine can write.

1. 01The machineA Turing machine reads a cell, writes, and moves. The finite control is the program.4 min
2. 02Recursive functionsZero, successor, projection, composition, primitive recursion, and minimisation. That is all computation.4 min