Concrete models of computation for topological algebras

DOI10.1016/S0304-3975(98)00296-5MaRDI QIDQ1292413zbMATH OpenOpenAlexFDO

Authors Viggo Stoltenberg-Hansen, John 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

Recommendations

• Abstract versus concrete computation on metric partial algebras
• Notions of semicomputability in topological algebras over the reals
• Generalizing Computability Theory to Abstract Algebras
• Computability on topological spaces via domain representations

Cites work

• scientific article; zbMATH DE number 3112803 (Why is no real title available?)
• scientific article; zbMATH DE number 3823751 (Why is no real title available?)
• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 107999 (Why is no real title available?)
• scientific article; zbMATH DE number 192929 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• scientific article; zbMATH DE number 821282 (Why is no real title available?)
• scientific article; zbMATH DE number 841092 (Why is no real title available?)
• scientific article; zbMATH DE number 3200656 (Why is no real title available?)
• A note on computable real fields
• Algebraic and fixed point equations over inverse limits of algebras
• Complete local rings as domains
• Computability and Noncomputability in Classical Analysis
• Computability in analysis and physics
• Computable Fields and Arithmetically Definable Ordered Fields
• Computable functionals
• Computation by `While' programs on topological partial algebras
• Domain interpretations of Martin-Löf's partial type theory
• Domain representability of metric spaces
• Domain theory and integration
• Dynamical systems, measures, and fractals via domain theory
• Embedding metric spaces into CPO's
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the definitions of computable real continuous functions
• Recursive characterization of computable real-valued functions and relations
• Recursive metric spaces
• Theory of representations
• Total sets and objects in domain theory

Cited in

(20)

• Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
• A natural weak limit space with admissible representation which is not a limit space
• Programming Experimental Procedures for Newtonian Kinematic Machines
• Notions of semicomputability in topological algebras over the reals
• A domain-theoretic framework for robustness analysis of neural networks
• Computability of analog networks
• Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
• A topological view on algebraic computation models
• Models of computation for partial functions on the reals
• Reducibility of domain representations and Cantor–Weihrauch domain representations
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• Characterizations of semicomputable sets of real numbers
• On computable metrization
• Continuity of operators on continuous and discrete time streams
• On computably locally compact Hausdorff spaces
• Extending the Notion of AT-Model for Integer Homology Computation
• Computation by `While' programs on topological partial algebras
• Extended admissibility.
• Embedding infinitely parallel computation in Newtonian kinematics
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems

This page was built for publication: Concrete models of computation for topological algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292413)