关键词: 图灵机 递归调用 模型 计算 算法

Abstract:

A Turing machine is the model of a general computer. The general programming and the computing with the model of a Turing machine support recursion. In this paper, the characteristics of recursion are analyzed. By using a multitape Turing machine as the computing model, the form of the transition func  tion is defined, the method of information transfer and storage based on the reeursive technology is presented. This paper also establishes a method to  implement the Turing machine invocation,gives the realization of the Turing machine reeursive technology, and proves that Turing machine invocation and  Turing machine recursive invocation are Turing-recognizable.

Key words: Turing machine, recursive invocation, model, computation, algorithm