Results 221 to 230 of about 29,432 (243)

Kolmogorov Complexity Cores

2010
We study the relationship between complexity cores of a language and the descriptional complexity of the characteristic sequence of the language based on Kolmogorov complexity. We prove that a recursive set A has a complexity core if for all constants c, the computational depth (the difference between time-bounded and unbounded Kolmogorov ...
openaire   +1 more source

Kolmogorov complexity, Optimization and Hardness

2006 IEEE International Conference on Evolutionary Computation, 2006
The Kolmogorov complexity (KC) of a string is defined as the length of the shortest program that can print that string and halts. This measure of complexity is often used in optimization to indicate expected function difficulty. While it is often used, there are known counterexamples.
Yossi Borenstein, Riccardo Poli
openaire   +1 more source

Kolmogorov complexity and random graphs

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On generalized kolmogorov complexity

1986
José L. Balcázar, Ronald V. Book
openaire   +1 more source

On computability of Kolmogorov complexity

1977
openaire   +1 more source

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Journal of Computer and System Sciences, 2011
Eric Allender, Michal Koucky
exaly  

Logical operations and Kolmogorov complexity

Theoretical Computer Science, 2002
Alexander Shen, Nikolay Vereshchagin
exaly  

Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets

SIAM Journal on Computing, 1996
Martin Kummer
exaly  

Kolmogorov complexity and the measures based on this complexity

Developments in Environmental Modelling, 2017
D T Mihailović, D Kapor, I Baláz̆
exaly  

A Kolmogorov complexity characterization of constructive Hausdorff dimension

Information Processing Letters, 2002
Elvira Mayordomo
exaly