Are you bored of this realm?

Tom Scott 2 days ago??

These are really great - this one taught me something new, and I really do feel like I understand it now! If you do this again, and you go to the Computing Museum, will you let people know, or will it be a surprise? :)

I know some people can't cope with the high speed delivery, and thus just stop watching - if YT had an easy 'slow this video down' button....

We need more like this.

xisumavoid 😱 I love when someone I admire on yt also admires someone else I admire, I wish you both the best.

Did not expect a Minecraft youtuber here!

Second comment I have seen from you on this channel!

wow uh hi

ecks eye zooma void

WΔY ΔWΔY The channel Computerphile (where Tom also featured a few times) has something on Huffman coding. And a lot more interesting stuff.

+miles4711 I also watch there. But Tom's approach here was well done in a way I hadn't quite seen before. That said, I'll look up those specific videos you mentioned. Thanks

So basically, this method is the best given the frequency distribution of those single characters. But... if you have more information on how your data is distributed/patterned, you can get further compression by using those patterns.

Right? I've got total blue brains now.

Then I suggest you check out Crash Course Computer Science. It's a bit more than just the basics.

Speaking of one take, have you seen the ending to "Will KZfaq Ever Run Out Of Video IDs?"? :)

Hello sir tutankhamon

frletmiflm with their old kit

Naa we just have to make doing the same thing more esoteric therefore appearing as advanced wizardry... just like we have for the last 20 years.

Ömåå Å

Few people even watch KZfaq videos like Tom Scott's and other educational stuff. Don't worry, most people are on music and entertainment.

@@traewatkins931 40 years. I started working as a programmer in 1979 😱, and that's how it was then 😂

@@usejasiri for some of us this is entertainment

I live how many of the comments are pointing that out and also changing one word in the comment as well

at which point translators just gave up subbing the video ಠ_ಠ

"Send Words" changing one letter becomes "Send Worms", becomes "Sand Worms", becomes THE SPICE MUST FLOW

'Matt'

Are you kidding? That was grape!

How many quines did you submit?

I'm not sure if it counts as a quine as it takes an external file

"You know how I was supposed to be picking a version control system? Well, I decided I didn't like any of them, so I wrote my own and checked it into itself. I put the repository on my web site..."

Yeah once I was like "Wait does git has it's own repo where it keeps track of itself? (check) oh actually it does". Another thing is that gcc is written in c, so it can compile itself.... moreover it can compile a newer version of itself

There are many program languages that are programmed in themself, and are compiled by itself. Nothing strange there. Look up Bootstraping.

Thus proving his point that some things like images or audio can be compressed using a lossy technique without losing any of the actual meaning (we could still see and understand a lower quality video.) you only loss detailing.

I think that's because everybody noticed that and it was a pretty obvious and predictable joke, whereas "sending the wrong worms" makes people do a double take.

I don’t think it was obvious, I thought it was inspired.

Smittens Yes, I noticed that and wondered at the coincidence.

To me, "Wild Wild West" is the least memorable movie in the history of cinema. OK, maybe except maybe for "Ishtar".

You have obviously never heard the masterpiece Wow Wow by the legend Neil Cicierega

Thanks for the tip! Maybe I'll even watch it (or try to do so :) ).

Walter Lowe I KN E W I WASNT THE ONLY ONE WHO CAUGHT THE REFERENCE

try Wow Wow by Neil Cicierega, I can assure you Wild Wild West (and All Star if you fall into the rabbithole that is Neil) will have a brand new type of impact on you !

Do one on 7Zip and RAR, too.

Karate Girl91 There are a lot of sophisticated compression algorithms. Zip, 7z, rar, gzip, deflate, bz2, botli, etc. Some of these are stream algorithms, and tend to work in a concert with tar to compress folders.

It's not Tom, but Prof. Brailsford did a video explaining LZ77, which is still a very popular compression algorithm, variants are used in in ZIP, Gzip, RAR etc. It's easy to understand and a good place to get started if you want to learn more: kzfaq.info/get/bejne/ndV_lJZ1rMvehXU.html

Ethan Pender has

im dying now

It reminded me of this! kzfaq.info/get/bejne/l7BgoamCzLiloI0.html

Hierophant yarn response was as goo as the original jack?

Taikamuna It took me a couple of minutes, but I got it in the end. The wrong worms is "the wrong words" but worms is the wrong word.

Before opening I assumed you would link this kzfaq.info/get/bejne/pq-dirl0ss2piYU.html

Im proud

Which one of the hundreds?

And he's not even the guy known as "red shirt guy". Though I bet Tom use a green or blue shirt in public to avoid people recognizing him.

oliilo1 Some of the guys at my local backspace know Tom, and apparently he only really wears his red tshirt when he knows/thinks he'll be filming. I only found this out when the guys at the hackspace found out I only wear green tshirts, every single day. It saves a decision in the morning, and makes washing so much easier.

*its

brayzbeats. Doing this means the most commonly used characters end up at the top with the shortest binary codes.

It's pretty simple really. Huffman Trees are very straightforward. Think about a short tree, like this one: o / \ o B / A o C D This means our alphabet has 4 letters. A, B, C and D. Now I want to compress a short text using this tree. The text is "DAB" (sorry, only thing I could think with these letters) So, we'll start by converting D into binary. To get to D, we gotta go to the left twice then to the right once, so here it goes: "Left Side: 0, Left Side: 0, Right Side: 1". So a D corresponds to 001 in binary. Now to get to A, it's 1 left and 1 right, so 01. Now to B, all I need is 1 right. so 1. This turns DAB into 001011. 6 bits of information. When you read this file, you'll convert 001011 back into DAB by doing the opposite process. You'll read bit by bit: 0 -> go to the left once. It's not a letter yet so read next bit. 0 -> Go to the left again, it's still not a letter so read next bit. 1 -> Go to the right. Oh it's a letter, letter D. OK so writing it down on the output: D. Now reset to the tree root and read next bit. 0 -> Left. Not a letter. Next Bit. 1 -> Right. It's the letter A! Write it down to the output. DA. Reset to root and next bit! 1 -> Right. It's the letter B! OK! Write it down to the output. DAB. There are no more bits to read so it's done! Your text is DAB!

brayzbeats. I do understand these well, but math and engineering videos go past vocabulary and I have to watch them twice to understand sometimes.

That's it.

That helped a lot, thank you!

Along with the fact that video compression artifacts were added just before that

@@KaosFireMaker such a nice little touch!

i dont get it

What I did was to store in the header of the compressed file the preorder traversal of the tree and then an array with information about which nodes are leaf nodes. You could also store combination of 2 different traversals, but "my" solution would only take up to [number of nodes] + ceil([number of nodes] / 8) bytes - not that significant difference, but still a difference :P

idt the tree itself is stored it is just used to create the translation list which is used to compress the data, then you can send the list and the compressed data

The algorithm watches all

Trurl In my school we did it

@@wappa6914 my school too. Did an Information Theory course in my final year.

Amazing to find this comment from you at the beginning of your channel! Now you have nearly 200,000 subscribers and that is simply amazing. Congrats!

@@Phil8sheo Was thinking the same. Amazing!

This comment is amazing. Wow.

Colten Pilgreen 😂 0:50

Exposed! You need to make sure your computer virus is compressed properly? :D

Wong

Ip happesad mo we onze

Let's imagine we have some "compression" tree and a string consisting of 10111010... . Every letter has an individual number assigned(the number is assigned with the tree). some are 4 digits long some are longer. So the computer sees the 1 and compares it with every assigned number. So the Pc checks 1-(every assigned number). If the result is zero it arrived at a letter. So the pc checks 1. No zero as result. Take the next bit 10. No 0 as result. Next bit 101. Still no zero as result. 1011 we get a zero as result. And display that letter. then we start again. 1. no zero as result .... Every letter has an individual path. So there will never be a letter assigned to 10111. that's how the pc knows when to seperate the string.

It separates the letters by referencing the tree. As it gets 1s and 0s it goes down the tree until it hits a dead end. The letter at that dead end is what is outputted, and the program heads back to the top of the tree. The structure of the tree is how it knows where the breaks are.

No branching point has a letter so if the point it comes to has a character instead of a branching path it has found the character needed and the next bit starts at the top of the tree.

Look at the graph at 5:02 Every time the computer reads a 1 it goes right in the tree, every time it reads a 0 it goes left. In this infinite sequence of zeros and ones, you only get to a letter at the end of a branch. You can imagine letters at the end of the branch as "leaves" in a tree, where every branch must end in one and only one leaf. The computer stores the entire tree so it knows if the sequence has reached a leaf or if it is still on a branch. If, with the last bit read, you did not get to a letter (end of branch) you continue reading. If you got to a letter, write the letter and start a new one.

Giacomo 3003 it knows because it reached the end of a branch.

The magnetic fields are defined by the orientation of electrons around the atoms of the disk; so it's 6 of one, half a dozen of the other really.

*Hold my toner.

Blah Cga it means "sending the wrong *words*" but he sent the wrong word so it says "worms"

The issue is that people are getting higher resolution displays, needing higher resolution textures, and games are using less repeating textures to make each location feel unique.

Jasper H haha IC what you mean

Blah Cga IC stands for intergrated circuit (the chips used in computers) so we were talking about ICs and I see

@Blah Cga Wrong words. Wrong worms.

It's a play on words; or rather, characters. Tom was supposed to say "The wrong words" but instead replaced a single character to represent the incorrect character being sent.

On that tangent, perhaps a video explaining how spell-checkers work? I think it had something to do with binary search trees, which I only briefly covered in college.

A quadrillion bits is actually 125 gigabytes, so I wouldn't consider it a mistake

ayyy

got the answer?

@@ipsitayankakoty652 paala ni