论文标题
关于S组合者的普遍性
On Universality of the S Combinator
论文作者
论文摘要
在结合性逻辑中，众所周知，两个组合k和s的集合是普遍的。从某种意义上说，任何其他组合者都可以用这两者表示。 K组合器不能仅以S组合量表示。这将回答斯蒂芬·沃尔夫拉姆（Stephen Wolfram）提出的一个问题，因为``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?''
