2 papers
cs.LO2011
Co-ordering and Type 2 co-ordering
Saeed Asaeedi, Farzad Didehvar
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order…
cs.CC2010
Enumeration Order complexity Equivalency
Saeed Asaeedi, Farzad Didehvar
Throughout this article we develop and change the definitions and the ideas in "arXiv:1006.4939", in order to consider the efficiency of functions and complexity time problems. The…