From the research index
The paper comes from the research index. It wasn’t submitted here.
Book chapter
Algorithms
Yorick Hardy, Willi-Hans Steeb
Birkhäuser Basel eBooks1 Jan 2001
Algorithms
Yorick Hardy, Willi-Hans Steeb · Birkhäuser Basel eBooks · 1 Jan 2001
Abstract
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
An algorithm [48, 63, 77, 97, 115] is a precise description of how to solve a problem. For example algorithms can be used to describe how to add and subtract numbers or to prove theorems. Usually algorithms are constructed with some basic accepted knowledge and inference rules or instructions. Thus programs in programming languages such as C++ and Java are algorithms. Thus an algorithm is a map f: E → A of the input data E to the set of output data A.
Identifiers
Discussion
Citations
Topics
Details
- Published
- 1 Jan 2001
- Issue
- Pages 3–22
- Language
- EN