Enumeration Order Equivalency

Details Enumeration Order Equivalency Enumeration Order Equivalency

2010-06-25

arxiv.org/abs/1006.4939v1

Computer Science

Logic in Computer Science

Scientific paper

In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions and also r.e. sets and studied their properties. Based on this reducibility we introduce an equivalence relation "Enumeration Order Equivalency". We have reached some properties of it. In subsequent, we have introduced another concept named "type-2 Enumeration Order Equivalency" and studied its properties too.

Affiliated with

Also associated with

No associations

Rating

Enumeration Order Equivalency 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 Equivalency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration Order Equivalency will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309843