Answers are grounded in this paper and cite their sources.
Sets which are efficiently reducible (in Karp's sense) to arbitrarily complex sets are shown to be polynomial computable. Analogously, sets efficiently reducible to arbitrarily sparse sets are polynomial computable. A key lemma for both proofs shows that any set which is not polynomial computable has an infinite recursive subset of its domain, on which every algorithm runs slowly on almost all arguments.
No takes yet. Share an insight, caveat, or question.
Nancy Lynch (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: