Abstract:
The notion of program-computable function on a universal
algebra is formalized through the notion of conditional term.
This leads to a somewhat new approach to the study of traditional
algebraic problems related to both universal classes and specific
finite algebras, and also enables one to pose and investigate the
problem of the computation resources of universal
algebras.