There is no ordering on the classes in the generalized high/low hierarchies

13 years 4 months ago

Download www.math.uchicago.edu

We prove that the existential theory of the Turing degrees, in the language with Turing reduction, 0, and unary relations for the classes in the generalized high/low hierarchy, is decidable.

Antonio Montalbán

Real-time Traffic

AML 2006 | Existential Theory | Turing Degrees | Turing Reduction |

claim paper

» Object detection and segmentation on a hierarchical regionbased image representation

» ThirdOrder Computation and Bounded Arithmetic

» Beyond Novelty Detection Incongruent Events when General and Specific Classifiers Disagree

» The Fast Generalized Gauss Transform

» Discriminative Learning of Relaxed Hierarchy for Largescale Visual Recognition

» Capacity Control for Partially Ordered Feature Sets

» Clustering pairwise dissimilarity data into partially ordered sets

» Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System S...

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	AML
Authors	Antonio Montalbán

Comments (0)

Sciweavers

There is no ordering on the classes in the generalized high/low hierarchies

AML 2006 | Existential Theory | Turing Degrees | Turing Reduction |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers