Abstract
We show that it is possible, for every machine universal for Kolmogorov complexity, to enumerate the lexicographically least description of a length n......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
