| 摘要: |
| 状态逻辑型程序设计语言是一种有坚实理论基础，既可描述递归又可描述迭代的高效、实用、新型的纯逻辑式程序设计语言．递归无疑地确保了其计算能力本文证明了仅用状态逻辑的迭代程序就可计算部分递归函数．这就等于证明了，任何图灵可计算的对象都可用纯逻辑迭代地定义和高效地计算． |
| 关键词: 状态逻辑，迭代计算，部分递归函数，可计算性． |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家863高科技项目基金资助. |
|
| THE COMPUTABILITY OF ITERATION PROGRAMS IN STATE LOGIC LANGUAGE |
|
Yan Zhixin
|
| Abstract: |
| Programming language based on state logic is an efficient，useful and practi-cal，new pure logical programming language with sound theoretical foundation．It can represent recursion and iteration．With reeursion its computability can be provided．This pa-per proves that partial recursive functions can be computed only with iteration programs in state logic．It means that any computable object in Turing machine can be defined itera tively and computed efficiently with Pure logic． |
| Key words: State logic,iteration computing,partial recurssion functions,computability． |
