Models of Computation Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 1, Lecture 2.
Computability
Computability Chapter 5. Overview Turing Machine (TM) considered to be the most general computational model that can be devised (Church-Turing thesis)
