On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
From MaRDI portal
Publication:5579042
Cited in
(21)- Lower bounds for Levin-Kolmogorov complexity
- Fractal analysis of pi normality
- The whole and the parts: the minimum description length principle and the a-contrario framework
- Temperature effects, Frieden-Hawkins' order-measure, and Wehrl entropy
- One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- Language-theoretic complexity of disjunctive sequences
- `Ideal learning' of natural language: positive results about learning from positive evidence
- Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- Algorithmic complexity as a criterion of unsolvability
- Quantum cryptography and meta-complexity
- Algebraic barriers to halving algorithmic information quantities in correlated strings
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Search-to-decision reductions for Kolmogorov complexity
- The principles of informational genomics
- On grammars, complexity, and information measures of biological macromolecules
- The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false
- Toward an abstract theory of data compression
- The critical roles of information and nonequilibrium thermodynamics in evolution of living systems
- On black-box meta complexity and function inversion
This page was built for publication: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579042)
