Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
type: Item
instance of: scholarly article
title: Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
zbMATH Open document ID: 1085.68094
author: John V. Tucker
author: Jeffery Zucker
published in: The Journal of Logic and Algebraic Programming
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 2136934
zbMATH Keywords: Many-sorted algebra
zbMATH Keywords: Topological algebra
zbMATH Keywords: Metric algebra
zbMATH Keywords: Uniform continuity
zbMATH Keywords: Computable function
zbMATH Keywords: Computable approximations
zbMATH Keywords: While programs
zbMATH Keywords: Countable choice
zbMATH Keywords: Conditional equations
MaRDI profile type: Publication
full work available at URL: j.jlap.2003.10.001
OpenAlex ID: W2085536580
cites work: Q4049364
cites work: Recursive characterization of computable real-valued functions and relations
cites work: Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
cites work: Algebraic specifications of computable and semicomputable data types
cites work: Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
cites work: Processes and the denotational semantics of concurrency
cites work: Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
cites work: Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
cites work: Algorithmic properties of structures
cites work: Computable functionals
cites work: On the definitions of computable real continuous functions
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Q3738547
cites work: Coupled map lattices as computational systems
cites work: Algebraic models of microprocessors architecture and organisation
cites work: Randnomness, computability, and algebraic specifications
cites work: Transfinite reductions in orthogonal term rewriting systems
cites work: Q5848892
cites work: Universal algebra in higher types
cites work: Topological methods for algebraic specification
cites work: Q3687683
cites work: Higher order data types
cites work: Final algebras, cosemicomputable algebras and degrees of unsolvability
cites work: On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
cites work: Recursive metric spaces
cites work: On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
cites work: Q3994907
cites work: Hierarchical reconstructions of cardiac tissue
cites work: Q2722021
cites work: Q5526189
cites work: On the Definition of Computable Function of a Real Variable
cites work: Complete local rings as domains
cites work: Q4857386
cites work: Concrete models of computation for topological algebras
cites work: Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
cites work: On effective topological spaces
cites work: Representations versus numberings: On the relationship of two computability notions
cites work: Q4039815
cites work: Examples of semicomputable sets of real and complex numbers
cites work: Computation by `While' programs on topological partial algebras
cites work: Abstract computability and algebraic specification
cites work: Q4793033
cites work: Abstract versus concrete computation on metric partial algebras
cites work: Numerical analysis as an independent science
cites work: Q4485693
DOI: 10.1016/J.JLAP.2003.10.001
Recommended article: Computability and continuity in metric partial algebras equipped with computability structures
Recommended article: Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
Recommended article: Metrizable extensions of dynamical systems from function algebras
Recommended article: Bounded algebraic systems and universal functions
Recommended article: Q4217607
Recommended article: On total functions, existence theorems and computational complexity
Recommended article: Q3727984
Recommended article: Q4888074
Recommended article: Generalizing Computability Theory to Abstract Algebras
Recommended article: Abstract versus concrete computation on metric partial algebras
description: scientific article; zbMATH DE number 2136934