(computing theory) A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked.

(computing theory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.

Able to be algorithmized.

The quality of being algorithmizable.

plural of algorithmist

One who studies algorithms.

The process of algorithmicizing.

Rule by algorithms, where political decisions are being made by algorithms, and thus making representative democracy obsolete.

A person who is unhappy to rely on data produced by an algorithm

plural of algorithmophobe