Dimensionality and randomness

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.