Sciweavers

CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 6 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
IFIPTCS
2010
13 years 9 months ago
Initial Segment Complexities of Randomness Notions
Schnorr famously proved that Martin-L
Rupert Hölzl, Thorsten Kräling, Frank St...
TCS
2010
13 years 10 months ago
Comparing notions of randomness
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
Bart Kastermans, Steffen Lempp
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 11 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 12 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
COMCOM
2008
91views more  COMCOM 2008»
13 years 12 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
NIPS
2003
14 years 1 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
MCU
2004
95views Hardware» more  MCU 2004»
14 years 1 months ago
Algorithmic Randomness, Quantum Physics, and Incompleteness
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
CSR
2006
Springer
14 years 3 months ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu