论文信息 - Enumeration Order Reducibility - 字舞流文

Enumeration Order Reducibility

In this article we define a new reducibility based on enumeration orders.

Farzad Didehvar | Ali Akbar Safilian | F. Didehvar | Aliakbar Safilian

[1] R. Shore. The recursively enumerable α-degrees are dense , 1976 .

[2] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[3] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.

[4] Farzad Didehvar,et al. Relation between the Usual Order and the Enumeration Orders of Elements of r.e. Sets , 2009, 0904.3607.