From Conservapedia
This is the current revision of Talk:Algorithm as edited by CatWatcher (Talk | contribs) at 14:47, April 5, 2007. This URL is a permanent link to this version of this page.

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Clearly defined end-state?

That seems a little ambiguous to me. Does a genetic algorithm have a clearly defined end-state? Tsumetai 10:28, 5 April 2007 (EDT)

The fact that you don't know exactly what the exact outcome to an algorithm will be does not prevent it from being clearly-defined. Foe example, a genetic algorithm will proceed towards an end-state, converging on a particular outcome which satisfies a set of clearly-defined criteria, such as the difference between iterations on any criteria is leass than 1% for example, or the success rate of the solution is greater than 95%, or the fit with... etc.

However, I agree I omitted genetic algorithms from the definition. As this definition was part of maths, I didn't consider that. Perhaps genetic algorithms should be referenced.--CatWatcher 10:47, 5 April 2007 (EDT)