Dimensionality and Randomness
Year: 2026
Type: article
Abstract: Arranging the bits of a random string or real into \( k \) columns of a 2D 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.
DOI: 10.1145/3806195
Authors: George Barmpalias, Xiaoyan Zhang
Institutions: Chinese Academy of Sciences, Institute of Software
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7146958006