نتایج جستجو برای: kolmogorov
تعداد نتایج: 7955 فیلتر نتایج به سال:
We study reals with infinitely many incompressible prefixes. Call A ∈ 2 Kolmogorov random if (∃∞n) C(A n) > n − O(1), where C denotes plain Kolmogorov complexity. This property was suggested by Loveland and studied by Martin-Löf, Schnorr and Solovay. We prove that 2-random reals are Kolmogorov random.1 Together with the converse—proved by Nies, Stephan and Terwijn [11]—this provides a natural c...
In this article, we prove that the Kolmogorov operator associated to the Burgers equation driven by a space-time white noise is m-dissipative. This implies several properties on the Kolmogorov equation. This result is obtained thanks to the introduction of a modified Kolmogorov operator. New a priori estimates on the solutions of the Burgers equation and on the invariant measure are obtained. T...
We extend and solve the classical Kolmogorov problem of finding general classes of Kolmogorov equations that can be transformed to the backward heat equation. These new classes include Kolmogorov equations with time-independent and time-dependent coefficients. Our main idea is to include nonlocal transformations. We describe a step-by-step algorithm for determining such transformations. We also...
A 1976 theorem of Chaitin can be used to show that arbitrarily dense sets of lengths n have a paucity of trivial strings (only a bounded number of strings of length n having trivially low plain Kolmogorov complexities). We use the probabilistic method to give a new proof of this fact. This proof is much simpler than previously published proofs, and it gives a tighter paucity bound.
We shall prove the second incompleteness theorem via Kolmogorov complexity.
This is a short introduction to Kolmogorov complexity and information theory. The interested reader is referred to the literature, especially the textbooks [CT91] and [LV97] which cover the fields of information theory and Kolmogorov complexity in depth and with all the necessary rigor. They are well to read and require only a minimum of prior knowledge. Kolmogorov complexity. Also known as alg...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید