Concrete models of computation for topological algebras

DOI10.1016/S0304-3975(98)00296-5zbMath0916.68047OpenAlexW2048858227MaRDI QIDQ1292413

Viggo Stoltenberg-Hansen, J. V. Tucker

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00296-5

zbMATH Keywords

topological algebramodel of computation

Mathematics Subject Classification ID

Related Items

Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Computability of analog networks, Programming Experimental Procedures for Newtonian Kinematic Machines, A domain-theoretic framework for robustness analysis of neural networks, Reducibility of domain representations and Cantor–Weihrauch domain representations, Characterizations of semicomputable sets of real numbers, Computable and Continuous Partial Homomorphisms on Metric Partial Algebras, A Natural Weak Limit Space with Admissible Representation which is not a Limit Space, On Computable Metrization, 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, On computably locally compact Hausdorff spaces, Computation by `While' programs on topological partial algebras, Domain representations of partial functions, with applications to spatial objects and constructive volume geometry., Extended admissibility.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domain theory and integration
• Domain representability of metric spaces
• Domain interpretations of Martin-Löf's partial type theory
• Theory of representations
• Embedding metric spaces into CPO's
• Algebraic and fixed point equations over inverse limits of algebras
• Total sets and objects in domain theory
• Computation by `While' programs on topological partial algebras
• Recursive characterization of computable real-valued functions and relations
• Dynamical systems, measures, and fractals via domain theory
• Computable functionals
• On the definitions of computable real continuous functions
• Computability and Noncomputability in Classical Analysis
• Complete local rings as domains
• A note on computable real fields
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computability in Analysis and Physics
• Recursive metric spaces
• Computable Fields and Arithmetically Definable Ordered Fields