00000cab a22000003a 4500 UP-99796217611693996 Buklod 20231008001536.0 m |o d | ta 150722s xx d | ||r ||||| || DENGII eng Albacea, Eliezer A. On turing machines Eliezer A. Albacea. August 2012 p. 1-11 In this paper, we define Turing machines and give examples of how Turing machines may be constructed. Also illustrated is how Turing Machines compute functions. We also discussed the Halting problem and the Church-Turing Thesis. Turing machine. Turing-computable function. Recursive language. Recursively enumerable language. Church-Turing Thesis. Philippine computing journal 7, 1 (2012(Ag)). FI UPD DENG-II Article