Complexity of majorants
Logic
2020-12-29 v2 Information Theory
math.IT
Abstract
The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most , is . If we replace "everywhere" by "for all sufficiently large inputs", the answer is .
Cite
@article{arxiv.2004.02844,
title = {Complexity of majorants},
author = {Alexander Shen},
journal= {arXiv preprint arXiv:2004.02844},
year = {2020}
}