Primality Testing in Polynomial Time pp 13-21 | Cite as

# 2. Algorithms for Numbers and Their Complexity

Chapter

## 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.

## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Springer-Verlag Berlin Heidelberg 2004