scientific article; zbMATH DE number 736618
From MaRDI portal
Publication:4326782
zbMath0922.68073MaRDI QIDQ4326782
Publication date: 23 March 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Randomness and reducibility ⋮ A Note on Blum Static Complexity Measures ⋮ Some combinatorial properties of self-reading sequences ⋮ Characterising the Martin-Löf random sequences using computably enumerable sets of measure one ⋮ A modular framework for quantum-proof randomness extractors ⋮ Physical versus computational complementarity. I ⋮ Randnomness, computability, and algebraic specifications ⋮ Language-theoretic complexity of disjunctive sequences ⋮ Optimal redundancy in computations from random oracles ⋮ Martingales in the Study of Randomness ⋮ Australasian Association for Logic George Hughes Memorial Conference ⋮ Random elements in effective topological spaces with measure. ⋮ Randomness as an invariant for number representations ⋮ Probabilistic issues in statistical mechanics ⋮ Relations between varieties of kolmogorov complexities ⋮ Random reals à la Chaitin with or without prefix-freeness ⋮ A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law ⋮ Hesitant fuzzy set lexicographical ordering and its application to multi-attribute decision making ⋮ Trivial Reals ⋮ Things that can be made into themselves ⋮ Regular reals ⋮ Searching for primes in the digits of \(\pi\) ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ Kolmogorov complexity and cellular automata classification ⋮ Randomness and Determination, from Physics and Computing towards Biology ⋮ A characterization of c. e. random reals ⋮ Comparison between the complexity of a function and the complexity of its graph ⋮ On the number of words containing the factor \((aba)^k\) ⋮ Computing a Glimpse of Randomness ⋮ Sample size lower bounds in PAC learning by Algorithmic Complexity Theory ⋮ Optimal representation in average using Kolmogorov complexity ⋮ Calibrating Randomness ⋮ Lowness properties and randomness ⋮ Entropic measures, Markov information sources and complexity ⋮ Thinking with notations: epistemic actions and epistemic activities in mathematical practice ⋮ A comparison of two approaches to pseudorandomness ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ The Kolmogorov complexity of real numbers. ⋮ Presentations of computably enumerable reals. ⋮ Randomness on full shift spaces ⋮ ``Linear chaos via paradoxical set decompositions. ⋮ On the degrees of constructively immune sets
This page was built for publication:
