2000 character limit reached
Complexity of majorants (2004.02844v2)
Published 6 Apr 2020 in math.LO, cs.IT, and math.IT
Abstract: The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the answer is $n+O(1)$.