|
|||||||||||||||
DOI: 10.1051/ita:2001101
Theoret. Informatics Appl. 35, 367-377 (2001)
The Helping Hierarchy
Patrizio Cintioli1 and Riccardo Silvestri21 Dipartimento di Matematica e Fisica, Università di Camerino, Via Madonna delle Carceri, 62032 Camerino (MC), Italy; (cintioli@campus.unicam.it)
2 Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza" , Via Salaria 113, 00198 Roma, Italy; (silvestri@dsi.uniroma1.it)
(Received June, 2000. Accepted November, 2001)
Abstract
Schöning [14] introduced a notion of helping and suggested
the study of the class
of the languages that can be helped
by oracles in a given class
. Later, Ko [12], in order to
study the connections between helping and "witness searching" ,
introduced the notion of self-helping for languages.
We extend this notion to classes of languages and show that there exists
a self-helping class that we call
which contains all the
self-helping classes.
We introduce the Helping hierarchy whose
levels are obtained applying a constant number of times the operator
to the set of all the languages. We show that the Helping
hierarchy collapses to the k-th level if and only if
is equal to the
k-th level. We give characterizations of all the levels and use these
to construct a relativized world in which the Helping
hierarchy is infinite.
AMS Subject: 68Q15, 68Q05, 03D15
© EDP Sciences 2001
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook