Initiality, induction, and computability
Algebraic methods in semantics
Algebraic specifications of computable and semicomputable data types
Theoretical Computer Science
Program correctness over abstract data types, with error-state semantics
Program correctness over abstract data types, with error-state semantics
Algebraic and fixed point equations over inverse limits of algebras
Theoretical Computer Science
Deterministic and nondeterministic computation, and horn programs, on abstract data types
Journal of Logic Programming
Handbook of logic in computer science (vol. 1)
Mathematical theory of domains
Mathematical theory of domains
Handbook of logic in computer science (vol. 4)
Journal of the ACM (JACM)
Control flow semantics
Complexity and real computation
Complexity and real computation
Concrete models of computation for topological algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computation by “while” programs on topological partial algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
Algorithmic Properties of Structures: Selected Papers of E. Engeler
Algorithmic Properties of Structures: Selected Papers of E. Engeler
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Denotational semantics of concurrency
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Abstract versus concrete computation on metric partial algebras
ACM Transactions on Computational Logic (TOCL)
First and Second Order Recursion on Abstract Data Types
Fundamenta Informaticae
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
Primitive recursive selection functions over abstract algebras
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Towards practical computable functions on context-free languages
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
First and Second Order Recursion on Abstract Data Types
Fundamenta Informaticae
| Hi-index | 0.00 |
Abstract computable functions are defined by abstract finitedeterministic algorithms on many-sorted algebras. We show thatthere exist finite universal algebraic specifications that specifyuniquely (up to isomorphism) (i) all abstract computable functionson any many-sorted algebra; (ii) all functions effectivelyapproximable by abstract computable functions on any metricalgebra. We show that there exist universal algebraicspecifications for all the classically computable functions on theset ℝ of real numbers. The algebraic specifications used aremainly bounded universal equations and conditional equations. Weinvestigate the initial algebra semantics of these specifications,and derive situations where algebraic specifications preciselydefine the computable functions.