Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 15:09, 17 May 2009 by Barras (talk | changes)

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.