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.
- Hermes, Hans. Enumerability, Decidability, Computability. Springer-Verlag, New York, 1969.Google Scholar
- Bowen, Roger. Use of the TUTOR System. Unpublished manual, Pennsylvania State University.Google Scholar
Index Terms
(auto-classified)Results of the use of a recursive function translator
Recommendations
Results of the use of a recursive function translator
SIGCSE '72: Proceedings of the second SIGCSE technical symposium on Education in computer scienceA 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 ...
Divide and translate: improving long distance reordering in statistical machine translation
WMT '10: Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATRThis paper proposes a novel method for long distance, clause-level reordering in statistical machine translation (SMT). The proposed method separately translates clauses in the source sentence and reconstructs the target sentence using the clause ...
The META/REDUCE translator writing system
The META/REDUCE translator writing system operates in a LISP environment closely interfaced with both LISP and REDUCE syntax. The language supports: BNF like syntax, recursive descent parsing schemes, lexical primitives, symbol table primitives, and ...






Comments