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 term. Functions are deterministic when if you never change what you give it (the input), that what you get out (the output) never changes either; and you can do this as many times as you want.

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