Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleTOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES.AuthorsDOWNEY, ROD; GREENBERG, NOAM; WEBER, REBECCAAbstractWe characterize the class of c.e. degrees that bound a critical triple (equivalently, a weak critical triple) as those degrees that compute a function that has no ω-c.e. approximation.SubjectsAPPROXIMATION theory; FUNCTIONAL analysis; CLOSURE of functions; POLYNOMIALS; PERTURBATION theory; STOCHASTIC approximationPublicationJournal of Mathematical Logic, 2007, Vol 7, Issue 2, p145ISSN0219-0613Publication typeArticleDOI10.1142/S0219061307000640