Computation by `While' programs on topological partial algebras

DOI10.1016/S0304-3975(98)00297-7zbMath0916.68046OpenAlexW2058108130WikidataQ127087500 ScholiaQ127087500MaRDI QIDQ1292414

J. V. Tucker, Jeffery Zucker

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)00297-7

zbMATH Keywords

topological algebrareal computationpartial algebraabstract compatibility

Mathematics Subject Classification ID

Related Items

Universality and semicomputability for nondeterministic programming languages over abstract algebras ⋮ The data type of spatial objects ⋮ Characterizations of semicomputable sets of real numbers ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Computable and Continuous Partial Homomorphisms on Metric Partial Algebras ⋮ Models of computation for partial functions on the reals ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms ⋮ On approximate and algebraic computability over the real numbers ⋮ Concrete models of computation for topological algebras ⋮ Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Theory of representations
• Fundamentals of generalized recursion theory
• Embedding metric spaces into CPO's
• Algebraic and fixed point equations over inverse limits of algebras
• A domain-theoretic approach to computability on the real line
• Concrete models of computation for topological algebras
• Recursive characterization of computable real-valued functions and relations
• Dynamical systems, measures, and fractals via domain theory
• Algorithmic approximations
• Computable functionals
• On the definitions of computable real continuous functions
• Complete local rings as domains
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• On the Definition of Computable Function of a Real Variable
• Order-free Recursion on the Real Numbers
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Examples of semicomputable sets of real and complex numbers
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Theory of computation over stream algebras, and its applications
• Algorithmic properties of structures
• Abstract First Order Computability. I
• Recursive metric spaces
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• Recursive Real Numbers

This page was built for publication: Computation by `While' programs on topological partial algebras