Research on Basic Instructions of Computability Function
-
Graphical Abstract
-
Abstract
A model proposed by Davis for computable functions is equivalent to Turing machine and consists of three basic Fortran-form instructions. In this paper, the Davis' three instructions were proved to be necessary, and three other equivalent instructions were also proposed. The model was proved to be equivalent to URM advanced by Shepherdson and Sturgis in 1963.
-
-