Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 16:38, 23 February 2009 by 149.173.6.110 (talk) (Created page with '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; an…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.