The OACC retrieves numerical approximations (upper bounds) of Algorithmic (Kolmogorov) Complexity (AC) for short strings (CTM), any length (BDM 1D), and binary matrices (BDM 2D). The techniques are not only an alternative to the widespread use of lossless compression algorithms to approximate AC, but true approaches to AC unlike lossless compression algorithms (e.g. BZIP2, LZ) that are based upon Entropy rate and are thus not more related to AC than Shannon Entropy itself (which is unable to compress anything but statistical regularities).
The following is an example for block size = 6 and block overlap = 1 :
Optimal parameters are usually largest possible block size (= 12) and no overlaping (= 0).
In the BDM formula, $|block|$ denotes the number of occurrences (multiplicity) of the block.
This video provides a short non-expert overview of how CTM and BDM work: