Results 11 to 20 of about 22,331 (209)
The dimension of ergodic random sequences [PDF]
, 2011 Let \mu be a computable ergodic shift-invariant measure over the Cantor space. Providing a constructive proof of Shannon-McMillan-Breiman theorem, V'yugin proved that if a sequence x is Martin-L\"of random w.r.t.
Hoyrup, Mathieu
core +5 more sources
Randomness extraction and asymptotic Hamming distance [PDF]
, 2013 We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-L\"of random in asymptotic Hamming distance. Our result is that the class of stochastically bi-immune sets is not Medvedev reducible to the class of
Bjoern Kjos-Hanssen +2 more
core +2 more sources
Dimension Extractors and Optimal Decompression [PDF]
, 2007 A *dimension extractor* is an algorithm designed to increase the effective dimension -- i.e., the amount of computational randomness -- of an infinite binary sequence, in order to turn a "partially random" sequence into a "more random" sequence ...
Doty, David
core +3 more sources
Around Kolmogorov complexity: basic notions and results
, 2015 Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic.
A Nies, M Li, RG Downey
core +2 more sources
Kolmogorov Complexity and Solovay Functions [PDF]
, 2009 Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x)
Bienvenu, Laurent, Downey, Rod
core +6 more sources
Algorithmic Randomness and Capacity of Closed Sets
, 2011 We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets K which have
A. McLinden and R.D. Mauldin +11 more
core +1 more source
, 2019 The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probability that a system will be in a certain state compared to the rest of the ...
Kiani, Narsis A. +2 more
core +1 more source
Coarse-Grained Probabilistic Automata Mimicking Chaotic Systems [PDF]
, 2003 Discretization of phase space usually nullifies chaos in dynamical systems. We show that if randomness is associated with discretization dynamical chaos may survive and be indistinguishable from that of the original chaotic system, when an entropic ...
Falcioni, M. +3 more
core +3 more sources
Effective Capacity and Randomness of Closed Sets
, 2010 We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets which have ...
Douglas Cenzer +3 more
core +2 more sources
Molecular Oncology, EarlyView.Meta‐transcriptome analysis identified FGF19 as a peptide enteroendocrine hormone associated with colorectal cancer prognosis. In vivo xenograft models showed release of FGF19 into the blood at levels that correlated with tumor volumes. Tumoral‐FGF19 altered murine liver metabolism through FGFR4, thereby reducing bile acid synthesis and increasing ...
Jordan M. Beardsley +5 more
wiley +1 more source