Concrete models of computation for topological algebras

DOI10.1016/S0304-3975(98)00296-5zbMATH Open0916.68047OpenAlexW2048858227MaRDI QIDQ1292413FDOQ1292413

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

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

zbMATH Keywords

topological algebramodel of computation

Mathematics Subject Classification ID

Cites Work

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

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.
• Reducibility of domain representations and Cantor–Weihrauch domain representations
• A topological view on algebraic computation models
• Models of computation for partial functions on the reals
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• On computable metrization
• Characterizations of semicomputable sets of real numbers
• On computably locally compact Hausdorff spaces
• Continuity of operators on continuous and discrete time streams
• 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)