4355 search results - page 21 / 871 » Increasing Kolmogorov Complexity |
APAL
2010
13 years 8 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
CAS
1999
13 years 8 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
ECCC
2010
13 years 8 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...