Thumbnail
Access Restriction
Subscribed

Author Krall, Edward J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract A recursive function interpreter was used to good effect in an undergraduate course in elementary automata theory. Although the functions were translated into combinations of Turing machines, the interpreter is not to be construed to be a Turing Table processor. The results in this paper reflect both the author's subjective judgment, and the compilation of statistics from a questionnaire given to the students.The primary effect was not the understanding of Turing machines or recursive functions but rather the enthusiasm for such study evidenced by the computer science students taking the course. The evaluation of the interpreter is an on-going process, extending even to students on the sophomore and junior level.This paper describes both the simulator and the effects of its use, as well as some general principles concerning such devices.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1978-02-01
Publisher Place New York
Journal ACM SIGCSE Bulletin (SGCS)
Volume Number 4
Issue Number 1
Page Count 6
Starting Page 110
Ending Page 115


Open content in new tab

   Open content in new tab
Source: ACM Digital Library