Abstract: 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 Order Reducibility on computable functions and also r.e. sets and studied their properties. Based on this reducibility we introduce an equivalence relation 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.
Publication Year: 2010
Publication Date: 2010-06-25
Language: en
Type: preprint
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot