1 paper · 1 filter
J. V. Tucker, J. I. Zucker
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specif…