Abstract
In the present section we want briefly to go into the connections between combinatory algebra and logic, and recursion theory. This will serve as a demonstration that concept formation in combinatory algebra has achieved its declared aim. We started out from the idea of capturing “algorithmic rules” by objects in an algebraic structure. But this is known to be also accomplished by the notion of a partially-recursive function; this is Church’s thesis. It therefore remains to show that each partially-recursive function corresponds to a combinator, which, applied to suitable numerical objects, does the same job.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
Hermes, H.: Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit; Einführung in die Theorie der rekursiven Funktionen, Springer-Verlag, Berlin, 1961
Kleene, S.C.: λ-definability and recursiveness, Duke Math. J. 2, pp. 344–353, (1936)
Engeler, E., Läuchli, P.: Berechnungstheorie für Informatiker, B.G. Teubner, Stuttgart, 1988
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Engeler, E. (1993). Computability and Combinators. In: Foundations of Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78052-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-78052-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78054-7
Online ISBN: 978-3-642-78052-3
eBook Packages: Springer Book Archive