books.google.co.uk - "On Computable Numbers, with an Application to the Entscheidungsproblem”, Alan Turing's paper of 1937, contained his thesis that every effective computation can be programmed on such an automation as that called Turing machine. Furthermore it proved the unsolvability of the halting problem and of the...http://books.google.co.uk/books/about/The_Universal_Turing_Machine.html?id=YafIDVd1Z68C&utm_source=gb-gplus-shareThe Universal Turing Machine
