Abstract
At the start of the study of algorithms stands the concept of a function, more precisely, the concept of calculable functions.
This is a preview of subscription content, log in via an institution to check access.
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
Curry, H.B.: Grundlagen der kombinatorischen Logik, Am. J. of Math. 52, pp. 509–536,789–834, (1930); see also the books with coauthors: Combinatory Logic, vols. I, II, Amsterdam, North-Holland, 1958, 1972
Frege, G.: Begriffschrift, Halle a.S., 1879, (cf. in particular § 9). 2. edition: Hildesheim, G. Olms Verlag, 1977
Schönfinkel, M.: Über die Bausteine der mathematischen Logik, Math. Annalen 92, pp. 305–316, (1924); in an addendum (by H. Behmann) there is an error, later realized by its author.
Quine, W.v.O.: On the building blocks of mathematical logic (= translation and commentary of the above paper), in: van Heijenoort, ed.: From Frege to Gödel. Cambridge, Mass., Harvard University Press, 1967
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Engeler, E. (1993). What is an Algorithm?. In: Foundations of Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78052-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-78052-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78054-7
Online ISBN: 978-3-642-78052-3
eBook Packages: Springer Book Archive