ALGORITHMIC INFORMATION THEORY
References (0)
Cited by (29)
Predictability of monthly streamflow by considering complexity measures
2024, Journal of HydrologyFourier transform bounded Kolmogorov complexity
2023, Physica D: Nonlinear PhenomenaA survey of techniques for characterising fitness landscapes and some possible ways forward
2013, Information SciencesCitation Excerpt :An example of this is Kolmogorov complexity (KC). KC, also known as algorithmic information theory [22], is a measure of an object that relates to the complexity of the computer program required to produce that object and then halt. A discrete fitness function defined over a finite space can be described by a single binary string consisting of all possible output values of the function.
MEPSI: An MDL-Based Ensemble Pruning Approach with Structural Information
2024, Proceedings of the AAAI Conference on Artificial Intelligence
Copyright © 2008 Elsevier B.V. All rights reserved.