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...
Saved in:
| Format: | Book |
|---|---|
| Published: |
Universiti Teknologi MARA, Terengganu,
1992.
|
| Subjects: | |
| Online Access: | Link Metadata |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000 am a22000003u 4500 | ||
|---|---|---|---|
| 001 | repouitm_16728 | ||
| 042 | |a dc | ||
| 245 | 0 | 0 | |a Turing Machine / Nordin Abu Bakar |
| 260 | |b Universiti Teknologi MARA, Terengganu, |c 1992. | ||
| 500 | |a https://ir.uitm.edu.my/id/eprint/16728/1/AJ_NORDIN%20ABU%20BAKAR%20AKADEMEIA%2092.pdf | ||
| 520 | |a 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. | ||
| 546 | |a en | ||
| 655 | 7 | |a Article |2 local | |
| 655 | 7 | |a PeerReviewed |2 local | |
| 787 | 0 | |n https://ir.uitm.edu.my/id/eprint/16728/ | |
| 856 | 4 | 1 | |u https://ir.uitm.edu.my/id/eprint/16728/ |z Link Metadata |