Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 13:48, 19 March 2010 by PiRSquared17Bot1 (talk | changes) (Robot: Automated text replacement (-{{stub}} +{{Tech-stub}}))

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.