Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
From MaRDI portal
Publication:1764798
DOI10.1016/j.jlap.2003.10.001zbMath1085.68094OpenAlexW2085536580MaRDI QIDQ1764798
Publication date: 22 February 2005
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2003.10.001
Uniform continuityComputable functionComputable approximationsConditional equationsCountable choiceMany-sorted algebraMetric algebraTopological algebraWhile programs
Related Items (11)
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 ⋮ Axiomatizing physical experiments as oracles to algorithms ⋮ Characterizations of semicomputable sets of real numbers ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Models of computation for partial functions on the reals ⋮ Continuity of operators on continuous and discrete time streams ⋮ 2007 Spring Meeting of the Association for Symbolic Logic ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological methods for algebraic specification
- On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
- Algebraic specifications of computable and semicomputable data types
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Final algebras, cosemicomputable algebras and degrees of unsolvability
- Universal algebra in higher types
- Concrete models of computation for topological algebras
- Computation by `While' programs on topological partial algebras
- Recursive characterization of computable real-valued functions and relations
- Randnomness, computability, and algebraic specifications
- Hierarchical reconstructions of cardiac tissue
- Algebraic models of microprocessors architecture and organisation
- Transfinite reductions in orthogonal term rewriting systems
- Computable functionals
- On the definitions of computable real continuous functions
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- Complete local rings as domains
- Higher order data types
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Initial Algebra Semantics and Continuous Algebras
- On the Definition of Computable Function of a Real Variable
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
- On effective topological spaces
- Coupled map lattices as computational systems
- Examples of semicomputable sets of real and complex numbers
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Processes and the denotational semantics of concurrency
- Abstract versus concrete computation on metric partial algebras
- Numerical analysis as an independent science
- Algorithmic properties of structures
- Recursive metric spaces
- Abstract computability and algebraic specification
- Representations versus numberings: On the relationship of two computability notions
This page was built for publication: Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
