On Wed, Mar 10, 2021 at 5:56 PM Jason Resch <jasonre...@gmail.com> wrote:
*> I believe Chaitin has a definition of randomness that works for finite > strings. If I remember correctly it has to do with the length of the > shortest program that outputs the string being longer than the string > itself.* > Yes, but that definition has one severe disadvantage. Mathematicians can prove that they are an infinite number of finite strings of X length in which there are no program shorter than X that could produce them, however there is no way to prove in general that one particular string of length X is of that nature. . John K Clark See what's on my new list at Extropolis <https://groups.google.com/g/extropolis> . -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to everything-list+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/CAJPayv2D-k2%3DA%2BY%3DT8SHQm-tgF7fpwmxRYvrc1Dt5VgQJ6CD2A%40mail.gmail.com.
