This content originally appeared on HackerNoon and was authored by Computational Technology for All
Table of Links
4 Members of Deep Π0 1 classes
3. On the Slow Growth Law
In this section, we provide a proof of the slow growth law and provide some hitherto unobserved consequences of the result. In particular, the proof of the slow growth law that we offer here is distinct from others in the literature in two respects. First, unlike other proofs in the literature, such as the one found in [JLL94], which are more complexity-theoretic (using the machinery of Kolmogorov complexity), our proof is measure-theoretic, being based on computable semimeasures. Second, the proof offered here is much more direct than currently available proofs of the slow growth law.
\
\ We are now ready to prove our main theorem.
\
\ Proof. Define q simply as the push-forward measure of p under F:
\
\
\ We note here some previously unnoticed consequence of slow growth law. First, observe that the standard unsolvable problems from computability theory are strongly deep, including:
\
\
:::info This paper is available on arxiv under CC BY 4.0 DEED license.
:::
:::info Authors:
(1) Laurent Bienvenu;
(2) Christopher P. Porter.
:::
\
This content originally appeared on HackerNoon and was authored by Computational Technology for All
Computational Technology for All | Sciencx (2025-01-16T01:05:15+00:00) Here’s Proof of the Slow Growth Law and Some Unobserved Consequences. Retrieved from https://www.scien.cx/2025/01/16/heres-proof-of-the-slow-growth-law-and-some-unobserved-consequences/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.