On the convergence of query-bounded computations and logical closure properties of C.e. Sets

Journal of Symbolic Logic 66 (4):1543-1560 (2001)
Abstract
Call a set A n-correctable if every set Turing reducible to A via a Turing machine that on any input makes at most n queries is Turing reducible to A via a Turing machine that on any input makes at most n-queries and on any input halts no matter what answers are given to its queries. We show that if a c.e. set A is n-correctable for some n ≥ 2, then it is n-correctable for all n. We show that this is the optimal such result by constructing a c.e. set that is 1-correctable but not 2-correctable. The former result is obtained by examining the logical closure properties of c.e. sets that are 2-correctable
Keywords Bounded Queries   Logical Closure Properties   Adversaries
Categories (categorize this paper)
DOI 10.2307/2694961
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,334
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
12 ( #422,133 of 2,225,156 )

Recent downloads (6 months)
1 ( #425,061 of 2,225,156 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature