Enumeration Order Reducibility
Formal Languages and Automata Theory
2010-03-03 v2 Computational Complexity
Abstract
In this article we define a new reducibility based on the enumeration orders of r.e. sets.
Cite
@article{arxiv.1002.0063,
title = {Enumeration Order Reducibility},
author = {Ali Akbar Safilian and Farzad Didehvar},
journal= {arXiv preprint arXiv:1002.0063},
year = {2010}
}
Comments
This paper is the second version of our work on Enumeration Orders