One of the most interesting aspects of the theory of computational complexity is the speed-up phenomenon such as the theorem of Blum [6, p. 326] which asserts the existence of a 0, 1-valued total recursive function with arbitrarily large speed-up. Blum and Marques [10] extended the speed-up definitions from total to partial recursive functions, or equivalently, to recursively enumerable (r.e.) sets, and introduced speedable and levelable sets. They classified the effectively speedable sets as the subcreative sets but remarked that “the characterizations we provided for speedable and levelable sets do not seem to bear a close relationship to any already well-studied class of recursively enumerable sets.” The purpose of this paper is to give an “information theoretic” characterization of speedable and levelable sets in terms of index sets resembling the jump operator. From these characterizations we derive numerous consequences about the degrees and structure of speedable and levelable sets.

Complexity theoretic properties of recursively enumerable sets

Computational complexity, speedable and levelable sets

: Subcreative sets, introduced by Blum, are known to coincide with the effectively speedable sets. Subcreative sets are shown to be the complete sets with respect to S-reducibility, a special case of Turing reducibility. Thus a set is effectively speedable exactly when it contains the solution to the halting problem in an easily decodable form. Several characterizations of subcreative sets are given, including the solution of an open problem of Blum, and are used to locate the subcreative sets with respect to the complete sets of other reducibilities. It is shown that q-cylindrification is an order-preserving map from the r.e. T-degrees to the r.e. S-degrees. Consequently, T-complete sets are precisely the r.e. sets whose q-cylindrifications are S-complete. (Author)

Complexity theoretic properties of recursively enumerable sets

Citations

Computational complexity, speedable and levelable sets

On Subcreative Sets and S-Reducibility

Some lowness properties and computational complexity sequences

On speedable and levelable vector spaces

Information Content Characterizations of Complexity Theoretic Properties

Related Papers (5)

Recursively enumerable sets in models of Σ2 collection

Recursively enumerable sets which are uniform for finite extensions

A Purely Homomorphic Characterization of Recursively Enumerable Sets

A Morphic Representation of Complements of Recursively Enumerable Sets

An Overview of the Computably Enumerable Sets