Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 10:41, 1 May 2009 by SieBot (talk | changes) (robot Adding: zh:确定性算法)

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.