|I. G. ROSENBERG, Département de mathématiques et statistique, Université de Montréal, Montréal, Quebec H3C 3J7, Canada|
|Completeness for uniformly delayed circuits|
We survey algebraic results on combinatorial circuits constructed from many-valued uniformly delayed gates. These involve the composition ofniformly delayed operations, the lattice of uniform clones, the corresponding relational theory, uniform completeness and the search for an effective completeness criterion. This is joint work with T. Hikita, Dept of Computer Science, Meiji University, Japan.