Turing Machine / Nordin Abu Bakar
Turing Machine is one of the earliest device in programming to describe or interpret a model for algorithmic specification. Beside Turing, Church and Kleene also offer their own formulations to define computability of functions. This article will take a glance through some formulations of computabil...
| Format: | Article |
|---|---|
| Language: | English |
| Published: |
Universiti Teknologi MARA, Terengganu
1992
|
| Online Access: | http://ir.uitm.edu.my/id/eprint/16728/ http://ir.uitm.edu.my/id/eprint/16728/1/AJ_NORDIN%20ABU%20BAKAR%20AKADEMEIA%2092.pdf |
| Summary: | Turing Machine is one of the earliest device in programming to describe or interpret a model for algorithmic specification. Beside Turing, Church and Kleene also offer their own formulations to define computability of functions. This article will take a glance through some formulations of computability by some Turing machines and their support to Church's Thesis. |
|---|