No label defined (Q3762301)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4012593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4012593 |
Statements
1986
0 references
p-isomorphism
0 references
complexity classes
0 references
topology
0 references
recursive languages
0 references
unprovably intractable languages
0 references
many-one reducibility
0 references
P-immune sets
0 references
incomparable pairs
0 references
[For the entire collection see Zbl 0591.00015.] By setting up a topology on the class of recursive languages, the author shows that the class of unprovably intractable languages (within any provable time-class) is downward-closed under many-one reducibility. Applications are given to languages A that unprovably separate \(P^ A\) from \(NP^ A\), or are unprovably non-p-isomorphic to SAT. Further applications involve P-immune sets, and reducibility structures with infinitely many incomparable pairs.
0 references