The paper describes an approach to measuring convergence of an algorithm to its result in terms of an entropy-like function of partitions of its inputs of a given length. It is a way to relate the set-theoretic definition of a function to the program that computes it. The approach, though very preliminary, may show how to improve a given algorithm.