View article

We give some general models of computation, including Turing Machines, partial recursive functions, and register machines. We discuss the Church-Turing Thesis. We prove the existence of a universal Turing machine and discuss Kleene Normal Form. We also look at primitive recursion.