Lazyweb, do any interesting things happen if you define an analogue of Kolmogorov complexity in terms of an explicitly non-Turing-complete description language?
-
-
On the other hand a program that output a given random sequence explicitly (one particular output of the PRF) would have very high entropy, versus an unrolling of the PRF inner loop which would be compressible.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Ya, would the entropy of a program without backwards branches correlate with its output? PRF which without backwards branches would need to be unrolled to the length of its output. The program entropy would be extremely low.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.