Deterministic algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

A deterministic algorithm is a computer science algorithm. A machine or algorithm is considered deterministic if, when you give it the same thing (the same input), that what you get out (the output) does not change. This is used in computer science because it ensures that an algorithm or machine is able to reliably return the same information. In mathematics, addition would be counted as a deterministic algorithm. This is because, given the same inputs, 4 and 8 for example, you will always get the same output, 12.

This short article about technology can be made longer. You can help Wikipedia by adding to it.