Results 1 
3 of
3
The Structure of Complete Degrees
, 1990
"... This paper surveys investigations into how strong these commonalities are. More concretely, we are concerned with: What do NPcomplete sets look like? To what extent are the properties of particular NPcomplete sets, e.g., SAT, shared by all NPcomplete sets? If there are are structural differences ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
This paper surveys investigations into how strong these commonalities are. More concretely, we are concerned with: What do NPcomplete sets look like? To what extent are the properties of particular NPcomplete sets, e.g., SAT, shared by all NPcomplete sets? If there are are structural differences between NPcomplete sets, what are they and what explains the differences? We make these questions, and the analogous questions for other complexity classes, more precise below. We need first to formalize NPcompleteness. There are a number of competing definitions of NPcompleteness. (See [Har78a, p. 7] for a discussion.) The most common, and the one we use, is based on the notion of mreduction, also known as polynomialtime manyone reduction and Karp reduction. A set A is mreducible to B if and only if there is a (total) polynomialtime computable function f such that for all x, x 2 A () f(x) 2 B: (1) 1
Generality’s price: Inescapable deficiencies in machinelearned programs
 Annals of Pure and Applied Logic
, 2006
"... This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some su ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some successfully learned programs is provably unalterably suboptimal. There are also results in which the complexity of successfully learned programs is asymptotically optimal and the learning device is general, but, still thanks to the generality, some of those optimal, learned programs are provably unalterably information deficient — in some cases, deficient as to safe, Preprint submitted to Elsevier Science 11 March 2007 algorithmic extractability/provability of the fact that they are even approximately optimal. For these results, the safe, algorithmic methods of information extraction will be by proofs in arbitrary, true, computably axiomatizable extensions of Peano Arithmetic. Key words: Computational learning theory; Applications of computability theory
Generality’s price: Inescapable deficiencies in machinelearned programs
 ANNALS OF PURE AND APPLIED LOGIC
, 2006
"... This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some su ..."
Abstract
 Add to MetaCart
This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some successfully learned programs is provably unalterably suboptimal. There are also results in which the complexity of successfully learned programs is asymptotically optimal and the learning device is general, but, still thanks to the generality, some of those optimal, learned programs are provably unalterably information deficient — in some cases, deficient as to safe, algorithmic extractability/provability of the fact that they are even approximately optimal. For these results, the safe, algorithmic methods of information extraction will be by proofs in arbitrary, true, computably axiomatizable extensions of Peano Arithmetic.