Enumeration Order Reducibility

Details Enumeration Order Reducibility Enumeration Order Reducibility

2010-01-30

arxiv.org/abs/1002.0063v2

Computer Science

Formal Languages and Automata Theory

This paper is the second version of our work on Enumeration Orders

Scientific paper

In this article we define a new reducibility based on the enumeration orders
of r.e. sets.

Affiliated with

Also associated with

No associations

Rating

Enumeration Order Reducibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration Order Reducibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration Order Reducibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251628