On the Kolmogorov−Chaitin Complexity for short sequences

Similar Items

• Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
  by: Soler−Toscano, F, et al.
  Published: (2014)
• Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
  by: Delahaye, J, et al.
  Published: (2012)
• Algorithmic complexity for short binary strings applied to psychology: a primer
  by: Gauvrit, N, et al.
  Published: (2013)
• Second quantized Kolmogorov complexity
  by: Rogers, C, et al.
  Published: (2008)
• How Incomputable Is Kolmogorov Complexity?
  by: Paul M.B. Vitányi
  Published: (2020-04-01)