Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 05:52, 4 September 2020 by LilyKitty (talk | changes) (about determinism)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.