scientific article; zbMATH DE number 428352
From MaRDI portal
Publication:3137692
zbMATH Open0785.01030MaRDI QIDQ3137692FDOQ3137692
Authors: A. N. Kolmogorov 
Publication date: 7 October 1993
Title of this publication is not available (Why is that?)
Recommendations
History of probability theory (60-03) Collected or selected works; reprintings or translations of classics (01A75) History of information and communication theory (94-03)
Cited In (31)
- Title not available (Why is that?)
- The theory of filtrations of subalgebras, standardness, and independence
- Efficient learning with robust gradient descent
- On computation of the Bessel function by summing up the series
- Bounding the expectation of the supremum of empirical processes indexed by Hölder classes
- Optimal recovery of isotropic classes of twice-differentiable multivariate functions
- Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
- Title not available (Why is that?)
- Information cohomology of classical vector-valued observables
- Randomized near-neighbor graphs, giant components and applications in data science
- Concentration behavior of the penalized least squares estimator
- Kolmogrov's \(\varepsilon\)-entropy and the problem of statistical estimation
- New solution of a problem of Kolmogorov on width asymptotics in holomorphic function spaces
- Kolmogorov entropy for classes of convex functions
- On the 120th Birthday of Andrei Nikolaevich Kolmogorov
- Nonlinear transformation on the transfer entropy of financial time series
- Dynamics of metrics in measure spaces and scaling entropy
- Title not available (Why is that?)
- Information transfer in continuous processes
- Title not available (Why is that?)
- Kolmogorov's heritage in mathematics. Transl. from the French
- Thickness of skeletons of arithmetic hyperbolic orbifolds
- On mm-Entropy of a Banach Space with Gaussian Measure
- Expander graphs in pure and applied mathematics
- Title not available (Why is that?)
- Andrei Kolmogorov and Leonid Levin on Randomness
- The security of machine learning
- Replica procedure for probabilistic algorithms as a model of gene duplication
- Title not available (Why is that?)
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
- THE MOSER'S ITERATIVE METHOD FOR A CLASS OF ULTRAPARABOLIC EQUATIONS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137692)
