]]>

https://www.seas.upenn.edu/~cit596/notes/dave/relang0.html ]]>

]]>

]]>

https://drive.google.com/drive/u/1/folders/0B33aKxI-RH2xS3VVdG1pOWFVamc ]]>

http://www.logicmatters.net/resources/pdfs/ComputabilityReading.pdf

This is an annotated reading list on the beginning elements of the theory of computable

functions. I ]]>

]]>

]]>

A Turing machine is a model of a machine which can mimic any other (known as a universal machine). What we call “computable” is whatever a Turing machine can write down. This video is about how it was conceived and why it works.

]]>