Abstract Computability, Algebraic Specification and Initiality

Details Abstract Computability, Algebraic Specification and Initiality Abstract Computability, Algebraic Specification and Initiality

2001-09-02

arxiv.org/abs/cs/0109001v1

Computer Science

Logic in Computer Science

To appear in ACM Transactions on Computational Logic (57 pages; AMSTeX)

Scientific paper

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable functions on any many-sorted algebra; and (ii) all functions effectively approximable by abstract computable functions on any metric algebra. We show that there exist universal algebraic specifications for all the classically computable functions on the set R of real numbers. The algebraic specifications used are mainly bounded universal equations and conditional equations. We investigate the initial algebra semantics of these specifications, and derive situations where algebraic specifications define precisely the computable functions.

Affiliated with

Also associated with

No associations

Rating

Abstract Computability, Algebraic Specification and Initiality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abstract Computability, Algebraic Specification and Initiality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstract Computability, Algebraic Specification and Initiality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384092