Having been adapted to use one or more algorithms.

Alternative form of algorithmic

(historical) Any of certain algorithms first described in Euclid's Elements.

(mathematics) Any algorithm that uses randomness as part of its logic.

(computing) A method of finding a nearly optimal solution to an optimization problem that cannot be solved exactly within a reasonable time.

(computing) A search heuristic that is based on biological evolution.

Kolmogorov complexity

An algorithm for the evolution of genotypes, which includes a selected, non-genetic component.

Informally, the property of a string being not longer than any computer program that can produce that string; that is, the property of a string being incompressible.

plural of genetic algorithm