In this paper, we study the computative structure of computable function - a structure of computative tree, and, by analysis on it, got the most general algorithm and model for computation on computable functions.
In this paper, we discuss some characteristic properties of partial abstract data type (PADT) and show the diffrence between PADT and abstract data type (ADT) in specification of programming language. Finally, we clar...In this paper, we discuss some characteristic properties of partial abstract data type (PADT) and show the diffrence between PADT and abstract data type (ADT) in specification of programming language. Finally, we clarify that PADT is necessary in programming language description.展开更多
基金Project supported by National Natural Science Foundation of China.
文摘In this paper, we study the computative structure of computable function - a structure of computative tree, and, by analysis on it, got the most general algorithm and model for computation on computable functions.
基金The Project Supported by National Natural Science Foundation of China
文摘In this paper, we discuss some characteristic properties of partial abstract data type (PADT) and show the diffrence between PADT and abstract data type (ADT) in specification of programming language. Finally, we clarify that PADT is necessary in programming language description.
