Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 17:33, 23 February 2009 by SassoBot (talk | changes) (robot Adding: cs, de, en, es, he, ja, ko, pl, sv, uk)

People in computer science call functions 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.

Retrieved from "https://simple.wikipedia.org/w/index.php?title=Deterministic_algorithm&oldid=1379693"