摘要
递归是"有限的手段无限的使用"。它使复杂的问题最终转化为一个与元问题相似的、规模较小的问题。语言递归建立在语言成份的离散无限性和梯级基础之上,并通过合并操作而得到实现,但递归运算并非完全自由,它受语法形式的本质特征限制。语言中存在着局部非递归成分,但并不能改变语言递归的本质属性。
Recursion is " finite means, infinite use", which converts a complex problem into a meta-problem alike and smaller-dimension problem. Recursion of language is founded on the language complements of discreteness and hierarchy. Through the operation of merger, recursion is realized. Recursion, however, which is restricted to property of grammar form in some degree, is not fully free. Partial non- recursion complements, which exist in language in some degree, cannot change the nature of language recursion.
出处
《中南林业科技大学学报(社会科学版)》
2009年第5期133-136,共4页
Journal of Central South University of Forestry & Technology(Social Sciences)
基金
2003年中南林业科技大学引进人才科研基金项目
关键词
递归
合并
递归基础
递归运算
recursion
merge
recursion foundation
recursion computation