Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
From MaRDI portal
Publication:2550943
DOI10.1007/BFb0112458zbMath0232.60001MaRDI QIDQ2550943
Publication date: 1971
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Foundations of probability theory (60Axx)
Related Items (only showing first 100 items - show all)
Scaled dimension and nonuniform complexity ⋮ Demuth’s Path to Randomness ⋮ When does randomness come from randomness? ⋮ Computability versus exact computability of martingales ⋮ Unnamed Item ⋮ On Kurtz randomness ⋮ The dimensions of individual strings and sequences ⋮ Equivalence of measures of complexity classes ⋮ The Kolmogorov complexity of random reals ⋮ Randomness and differentiability ⋮ Uncertainty, predictability and decidability in chaotic dynamical systems ⋮ Randomness, Computation and Mathematics ⋮ A Correspondence Principle for Exact Constructive Dimension ⋮ Mutual dimension and random sequences ⋮ Initial segment complexities of randomness notions ⋮ The Kolmogorov complexity of infinite words ⋮ Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers ⋮ On generalized computable universal priors and their convergence ⋮ An approach of randomness of a sample based on its weak ergodic limit ⋮ Randomness and universal machines ⋮ Recursive computational depth ⋮ Randomness? What randomness? ⋮ Randomness and uniform distribution modulo one ⋮ Schnorr randomness for noncomputable measures ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Exact constructive and computable dimensions ⋮ Random elements in effective topological spaces with measure. ⋮ Sequential mappings of $\omega $-languages ⋮ Notes on sum-tests and independence tests ⋮ Test martingales, Bayes factors and \(p\)-values ⋮ Lowness, Randomness, and Computable Analysis ⋮ Some Questions in Computable Mathematics ⋮ COMPLEXITY, INFORMATION, ENERGY ⋮ Prequential Randomness ⋮ Granularity of wagers in games and the possibility of saving ⋮ Capital Process and Optimality Properties of a Bayesian Skeptic in Coin-Tossing Games ⋮ Subcomputable Hausdorff function dimension ⋮ Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) ⋮ Unnamed Item ⋮ Leading strategies in competitive on-line prediction ⋮ Bi-immunity over different size alphabets ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ Schnorr Randomness ⋮ Things that can be made into themselves ⋮ Algorithmic randomness and Fourier analysis ⋮ On Oscillation-free ε-random Sequences ⋮ A Characterization of Constructive Dimension ⋮ How powerful are integer-valued martingales? ⋮ Universal recursively enumerable sets of strings ⋮ Schnorr Trivial Reals: A construction ⋮ Effective Randomness for Computable Probability Measures ⋮ Selection by Recursively Enumerable Sets ⋮ Randomness on computable probability spaces -- a dynamical point of view ⋮ Arithmetical Measure ⋮ Kolmogorov-Loveland stochasticity and Kolmogorov complexity ⋮ Unnamed Item ⋮ A combinatorial characterization of sequential p. martin-löf tests ⋮ Prequential randomness and probability ⋮ Process and truth-table characterisations of randomness ⋮ Prediction and dimension ⋮ Probability in 1919/20: the von Mises-Pólya-controversy ⋮ Unnamed Item ⋮ Gales suffice for constructive dimension ⋮ Unnamed Item ⋮ Difference randomness ⋮ Some applications of computable one-one numberings ⋮ Wahrscheinlichkeitsrechnung im Spannungsfeld von Maß- und Häufigkeitstheorie -- Leben und Werk des ``Deutschen Mathematikers Erhard Tornier (1894-1982) ⋮ Monotonous betting strategies in warped casinos ⋮ Highness properties close to PA completeness ⋮ Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension ⋮ A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties ⋮ Quasi-Monte Carlo methods and pseudo-random numbers ⋮ Kolmogorov complexity and strong approximation of Brownian motion ⋮ A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS ⋮ Genericity and randomness over feasible probability measures ⋮ Kolmogorov-Complexity Based on Infinite Computations ⋮ A topological characterization of random sequences ⋮ Genericity and measure for exponential time ⋮ Resource bounded randomness and computational complexity ⋮ Randomness is inherently imprecise ⋮ Constructive equivalence relations on computable probability measures ⋮ Unnamed Item ⋮ Endliche Automaten und Zufallsfolgen ⋮ Lowness properties and randomness ⋮ The simulation of random processes on digital computers: Unavoidable order ⋮ Hintikka and the functions of logic ⋮ On partial randomness ⋮ Kolmogorov-Loveland randomness and stochasticity ⋮ Recursive computational depth. ⋮ Thinking with notations: epistemic actions and epistemic activities in mathematical practice ⋮ Resource-bounded martingales and computable Dowd-type generic sets ⋮ On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Normality in non-integer bases and polynomial time randomness ⋮ Integer valued betting strategies and Turing degrees ⋮ Feasible analysis, randomness, and base invariance ⋮ Schnorr triviality and its equivalent notions ⋮ Trivial measures are not so trivial ⋮ Denjoy, Demuth and density ⋮ Closure of resource-bounded randomness notions under polynomial time permutations
This page was built for publication: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
