1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.OH2018
Approximability in the GPAC
Diogo Poças, Jeffery Zucker
Most of the physical processes arising in nature are modeled by either ordinary or partial differential equations. From the point of view of analog computability, the existence of…
cs.LO2001★ 1 cited
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★ 1 cited
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…