CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 13
Costas Busch - LSU1 A Universal Turing Machine. Costas Busch - LSU2 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Linear Bounded Automata LBAs
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
