Complexity of majorants

04/06/2020 ∙ by Alexander Shen, et al. ∙ 0

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

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.