关于S组合子的普适性
On Universality of the S Combinator
摘要:
在组合逻辑中,已知两个组合子K和S的集合是通用的;在这个意义上,任何其他组合子都可以用这两个表示。K组合子不能只用S组合子来表示.这将回答斯蒂芬·沃尔夫勒姆提出的一个问题,即“S组合子在它自己的计算中是通用的吗?”''
英文摘要:
In combinatory logic it is known that the set of two combinators K and S are universal; in the sense that any other combinator can be expressed in terms of these two. K combinator can not be expressed only in terms of the S combinator. This will answer a question raised by Stephen Wolfram as ``Is the S combinator on its own computation universal?''
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。