Turing Machine / Nordin Abu Bakar

Abu Bakar, Nordin (1992) Turing Machine / Nordin Abu Bakar. AKADEMEIA, 1 (2). pp. 35-41. ISSN 0128-5610

[img]
Preview
Text
AJ_NORDIN ABU BAKAR AKADEMEIA 92.pdf

Download (11MB) | Preview

Abstract

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.

Item Type: Article
Uncontrolled Keywords: Turing Machine; Algorithms, Programming
Subjects: Q Science > QA Mathematics > Instruments and machines > Electronic computers.Computer science > Algorithms
Q Science > QA Mathematics > Instruments and machines > Electronic computers.Computer science > Algorithms
Divisions: Universiti Teknologi MARA, Terengganu
Depositing User: Staf Pendigitalan 5
Date Deposited: 18 Apr 2017 03:24
Last Modified: 18 Apr 2017 03:24
URI: http://ir.uitm.edu.my/id/eprint/16728

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year