Corrigendum: "Computational Complexity and the Existence of Complexity Gaps"

Abstract

Let • be a complexity measure, g a nonde-creasing recursive function such that (Vx)g(x) >_ x. Then 3 an increasing recursive function t such that no ~i satisfies t(x) < ~(x) _~ g o t(x) i.o. x. 
DOI: 10.1145/321707.321723

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics