Abstract
What is an algorithm? Clearly, everybody has seen many kinds of them already: recipes, directions, computer programs are all different variants of algorithms. Just as this abundance of examples facilitates the task of explaining the ideas and aims of the abstract notion of an “algorithm” it makes a formal definition difficult. In this chapter we introduce the concept of a random access machine and use it to define what we will henceforth mean when we speak of an algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden
About this chapter
Cite this chapter
Prömel, H.J., Steger, A. (2002). Basics II: Algorithms. In: The Steiner Tree Problem. Advanced Lectures in Mathematics. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80291-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-322-80291-0_2
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-528-06762-5
Online ISBN: 978-3-322-80291-0
eBook Packages: Springer Book Archive