Complexity of majorants

04/06/2020

∙

by   Alexander Shen, et al.

∙

0

∙

share

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).