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.
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 [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/everything-list/97a84823-42c1-91ad-98c5-2e45b68987ff%40verizon.net.
