Showing cs.LOShow all
2 papers · 1 filter
cs.LO2001
Abstract Computability, Algebraic Specification and Initiality
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…
cs.LO2001
Abstract versus Concrete Computation on Metric Partial Algebras
J. V. Tucker, J. I. Zucker
A model of computation is abstract if, when applied to any algebra, the resulting programs for computable functions and sets on that algebra are invariant under isomorphisms, and h…