Abstract
The central notions in this book are those of the algorithm and computation, not a particular algorithm for a particular problem or a particular computation, but the algorithm and computation in general. The first algorithms were discovered by the ancient Greeks. Faced with a specific problem, they asked for a set of instructions, whose execution in the prescribed order would eventually provide the solution to the problem. This view of the algorithm sufficed since the fourth century B.C.E., which meant there was no need to ask questions about algorithms and computation in general.
A recipe is a set of instructions describing how to prepare something. A culinary recipe for a dish consists of the required ingredients and their quantities, equipment and environment needed to prepare the dish, an ordered list of preparation steps, and the texture and flavor of the dish.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Robič, B. (2015). Introduction. In: The Foundations of Computability Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44808-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-44808-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44807-6
Online ISBN: 978-3-662-44808-3
eBook Packages: Computer ScienceComputer Science (R0)