On turing machines

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.

Bibliografiska uppgifter
I publikationen:Philippine computing journal 7, 1 (2012(Ag)).
Huvudupphovsman: Albacea, Eliezer A.
Materialtyp: Artikel
Språk:English
Ämnen: