Turing Machines & Computability

views comments

A quick tour of the notion of a Turing machine, computable vs. not computable, the Halting problem (is unsolvable), recursive and recursively enumerable sets.