911 search results - page 20 / 183 » Kolmogorov Complexity Cores |
APAL
2010
15 years 2 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
15 years 1 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...
126
click to vote
CODES
2000
IEEE
15 years 6 months ago
2000
IEEE
The concept of system-on-a-chip is becoming increasingly popular for the integration of complex systems. New types of processor cores are now available that enable the designer to...
102
click to vote
MFCS
2005
Springer
15 years 7 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...
106
click to vote
CORR
2007
Springer
15 years 1 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...