Abstract
The notion of an algorithm is basic in computer science. Usually, one says that an algorithm is a finite piece of text that describes in an unambiguous way which elementary computational steps are to be performed on any given input, and in which way the result should be read off after the computation has ended. In the theory of algorithms and in computational complexity theory, one traditionally formalizes the notion of an algorithm as a program for a particular theoretical machine model, the Turing machine.
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.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dietzfelbinger, M. (2004). 2. Algorithms for Numbers and Their Complexity. In: Primality Testing in Polynomial Time. Lecture Notes in Computer Science, vol 3000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25933-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-25933-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40344-9
Online ISBN: 978-3-540-25933-6
eBook Packages: Springer Book Archive