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.

Bibliographische Detailangaben

Veröffentlicht in:	Philippine computing journal 7, 1 (2012(Ag)).
1. Verfasser:	Albacea, Eliezer A.
Format:	Artikel
Sprache:	English
Schlagworte:	Turing machine. Turing-computable function. Recursive language. Recursively enumerable language. Church-Turing Thesis.