arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.4939cs.LOmath.LO
收藏

枚举顺序等效性

Enumeration Order Equivalency

Ali Akbar Safilian, Farzad Didehvar

摘要:

本文研究了r.e.用图灵机枚举的集合。我们已经定义了一个基于枚举顺序的约简,命名为“枚举顺序约简”,用于可计算函数,也是r.e.并研究了它们的性质。在此基础上,我们引入了一个等价关系“枚举顺序等价”。在此基础上,我们引入了二型枚举序等价的概念,并研究了它的一些性质。

英文摘要:

In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions and also r.e. sets and studied their properties. Based on this reducibility we introduce an equivalence relation "Enumeration Order Equivalency". We have reached some properties of it. In subsequent, we have introduced another concept named "type-2 Enumeration Order Equivalency" and studied its properties too.

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

↑