> On 20 Feb 2020, at 22:24, 'Brent Meeker' via Everything List > <everything-list@googlegroups.com> wrote: > > > > On 2/20/2020 4:22 AM, Bruno Marchal wrote: >>> Can a finite sequence be algorithmically incompressible? Can't I just >>> give it a name, say "Albert" and write 'print albert’. >> >> >> Yes, a finite sequence is said "algorithmically incompressible” when the >> shortest program to generate that sequence is about the same length than the >> sequence. The term “about” made this notion dependent of a constant >> parameter which might depend on the choice of universal machine used for the >> program. > > That's my point. I can always chose a machine which has a short program for > the sequence.
How? Can you write a program much shorter than this sequence, and generating it? 10001101110010111110010010100010110000000000011101110010000111110111000100101000 Bruno > > Brent > >> >> Usually a infinite sequence is said incompressible if all its finite >> sequence are incompressible. > > > -- > 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/97a84823-42c1-91ad-98c5-2e45b68987ff%40verizon.net. -- 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/88D02897-A81B-4AB9-8884-FFDDF1F9A232%40ulb.ac.be.
