Arranging the bits of a random string or real into k columns of a two-dimensional array or higher dimensional structure is typically accompanied with loss in the Kolmogorov complexity of the columns, which depends on k. We quantify and characterize this phenomenon for arrays and trees and its relationship to negligible classes.

翻译：将随机字符串或实数的比特排列成二维数组的k列或更高维结构时，通常伴随着列间Kolmogorov复杂度的损失，该损失取决于k。我们针对数组与树结构量化并刻画了这一现象，及其与可忽略类之间的关联。