On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
From MaRDI portal
Publication:5579042
DOI10.1145/321526.321530zbMath0187.28401OpenAlexW1977165845WikidataQ56038297 ScholiaQ56038297MaRDI QIDQ5579042
Publication date: 1969
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321526.321530
Related Items (12)
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) ⋮ The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework ⋮ `Ideal learning' of natural language: positive results about learning from positive evidence ⋮ Algorithmic complexity as a criterion of unsolvability ⋮ The critical roles of information and nonequilibrium thermodynamics in evolution of living systems ⋮ Language-theoretic complexity of disjunctive sequences ⋮ The principles of informational genomics ⋮ 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 grammars, complexity, and information measures of biological macromolecules ⋮ Fractal Analysis of Pi Normality ⋮ Toward an abstract theory of data compression
This page was built for publication: On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
