PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING.pdfVIP

PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING ROD DOWNEY, NOAM GREENBERG, JOSEPH S. MILLER, AND REBECCA WEBER Abstract. We show that the class of c.e. degrees that can be joined to 0′ by an array computable c.e. degree properly contains the class of promptly simple degrees. 1. Introduction The main class examined in this paper is the class of array computable degrees introduced by Downey, Jockusch and Stob in [11, 12]. We recall from [12] that a c.e. degree a is array noncomputable iff for all g 6wtt 0′ there is a function f 6T a that is not dominated by g; that is, for infinitely many x