arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0109001cs.LO
收藏

抽象可计算性、代数规范与初始性

Abstract Computability, Algebraic Specification and Initiality

J. V. Tucker, J. I. Zucker

摘要:

可计算函数是由多排序代数上的抽象有限确定性算法定义的。我们表明,存在有限的通用代数规范,指定唯一(同构)(i)所有抽象的可计算函数的任何多排序代数;和(ii)所有功能有效地逼近抽象可计算函数的任何度量代数。我们证明了实数集R上的所有经典可计算函数都存在泛代数规范。所使用的代数规范主要是有界泛方程和条件方程。我们调查这些规范的初始代数语义,并推导出代数规范精确定义可计算函数的情况。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑