Abstract versus concrete computation on metric partial algebras

DOI10.1145/1024922.1024924zbMath1367.68102OpenAlexW2094663018MaRDI QIDQ5277710

Jeffery Zucker, J. V. Tucker

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1024922.1024924

zbMATH Keywords

countable choicetopological algebrapartial algebradata typesmetric algebraeffective Banach spaceeffective metric spaceabstract computation

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (25)

Universality and semicomputability for nondeterministic programming languages over abstract algebras ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Computability of analog networks ⋮ Programming Experimental Procedures for Newtonian Kinematic Machines ⋮ Oracles and Advice as Measurements ⋮ Reducibility of domain representations and Cantor–Weihrauch domain representations ⋮ Hierarchies of total functionals over the reals ⋮ Characterizations of semicomputable sets of real numbers ⋮ Stability of representations of effective partial algebras ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Effectivity and effective continuity of multifunctions ⋮ On the Continuity of Effective Multifunctions ⋮ Models of computation for partial functions on the reals ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Continuity of operators on continuous and discrete time streams ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ A hypercomputational alien ⋮ Efficient exact computation of iterated maps ⋮ Experimental computation of real numbers by Newtonian machines ⋮ 2007 Spring Meeting of the Association for Symbolic Logic ⋮ Feferman on Computability ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms ⋮ Exact real arithmetic using centred intervals and bounded error terms

This page was built for publication: Abstract versus concrete computation on metric partial algebras