anyway at this point let’s just see where zug gets the tossup
Kolmogorov complexity can be conceptualized as measuring an optimal form of this
process.
2 Likes
It’s like 4PM
1 Like
you should go to sleep by 10 am then
2 Likes
Somebody commented on my hair being really thick today
NYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA unsleeped
Inputs for this task can be preprocessed by the Burrows–Wheeler transform,
this hair looks pretty thick yeah
1 Like
IDK what any of this means but nya
well if you think you know the answer you can guess it at any time
netcat
which arranges “similar” characters together.
NOT a guess I just randomly sadi ti
…i don’t think so?
1 Like
oh. look cs names its terms the randomest things
1 Like
One algorithm for this task uses symbol frequencies to construct a prefix tree
netcat is a program that. does things idk
oh I actually know that
huffman encoding is the algorithm
so, File Compression
good buzz
1 Like
apparently this is what the first clue’s about, actually seems interesting. wonder how the other team knew as much about it as they did though
1 Like
A family of algorithms for this task is named for Abraham Lempel and Jacob Ziv. Shannon’s source coding theorem bounds the efficiency of this process. Huffman codes can be used to perform a “lossless” form of this task. For 10 points, name this process that decreases the number of bits needed to store information, which can create .zip files
1 Like