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.
rnThe 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.
rnThis paper describes both the simulator and the effects of its use, as well as some general principles concerning such devices.
在基本自动机理论的本科课程中,使用递归函数解释器取得了很好的效果。尽管将功能翻译为图灵机的组合,但解释器不应解释为图灵表处理器。本文的研究结果既反映了作者的主观判断,也反映了从对学生的问卷调查中收集的统计数据。 P> rn
主要作用不是理解图灵机或递归函数,而是热情参加计算机课程的计算机科学学生证明了这种研究。对口译员的评估是一个持续的过程,甚至延伸到大二和初中阶段的学生。 P> rn
本文介绍了模拟器及其使用效果以及一些一般原理关于此类设备。 P>
机译:表征为一类实数递归函数的递归分析
机译:递归函数的递归调用数
机译:Frobenius线性转换器带来了新的无限类排列和弯曲函数
机译:Real递归功能和递归函数的实际扩展
机译:用于递归函数的ZARF架构
机译:递归指数加权N偏最小二乘回归与递归验证的超参数在脑机接口应用中
机译:在可怕的递归函数和序数递归函数*
机译:Kleene层次中的实数和函数以及递归有理函数的限制