Chaitin has triggered an important insight for me: a mathematical proof represents the successful compression of the semantics of a statement into its axioms. Undecidability means incompressibility.
-
-
Replying to @disitinerant
but you will only know that they are perfectly compressible when you did so
0 replies 0 retweets 0 likes -
Replying to @disitinerant
Yes, we can deduce that we are probably in some kind of fractal, and we may be able to identify the possible generator function and candidate regions, but we did not achieve either yet, and so we don't know where we are.
1 reply 0 retweets 1 like
Replying to @disitinerant
we have an excellent model of layered functions that does decent local compression and has no singularities in the areas where we do most of our regulation
11:03 PM - 28 Sep 2018
from San Francisco, CA
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.