A set of computations that, composed with one another, permit one to recover the whole set of possible computations in the repertoire of the universal computer is called a ‘universal set’. When there is a universal set, any computation is reducible to a Sequence of elementary computations selected from the universal set.