is there any hierarchy for many-one complete languages of re (re-complete languages)? how can we propose a categorization for these languages? depending on what measures?
how can we categorize m-complete languages of RE (recursive enumerable, re-complete)?
0
$\begingroup$
computability
-
0using a weaker reduction. – 2012-02-13