We will call an algorithm complete if it is successful in every situation in which a distinguishing description exists.
experimental research on "minimal cooperative effort" (Clark 1992;Cremers 1996) points in the same direction.