Turing Machine / Nordin Abu Bakar

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

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.

Metadata

Item Type: Article
Divisions: Universiti Teknologi MARA, Terengganu
Journal or Publication Title: AKADEMEIA
ISSN: 0128-5610
Volume: 1
Number: 2
Page Range: pp. 35-41
Item ID: 16728
Uncontrolled Keywords: Turing Machine; Algorithms, Programming
URI: http://ir.uitm.edu.my/id/eprint/16728

Download

[img] Text
AJ_NORDIN ABU BAKAR AKADEMEIA 92.pdf

Download (0B)

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year