Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 11:03, 10 March 2013 by Addbot (talk | changes) (Bot: 15 interwiki links moved, now provided by Wikidata on d:q1064349)

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.