[User] Please transcribe this text

[Assistant] Uh, so, uh, actually once you one sort, that's insertion sort, so you're going to always get an assorted result. The only difference is how efficient is that.


[User] Please transcribe this text

[Assistant] Now, uh, the intuition behind shell sort and actually the mathematical fact is that if you've got an array that's h-sorted and then you k-sorted for another value k different from h, it's still h-sorted.


[User] Please transcribe this text

[Assistant] This is one of those mathematical facts that, uh, seems obvious. Uh, but then if you try to prove it, maybe it's a little more subtle than you think. Uh, so if you think of all this is, uh, is, is trivial and easy, uh, go ahead and try to write down a proof, uh, that a G sorted array re, remains G sorted even after it's H sorted.


[User] Please transcribe this text

[Assistant] Uh, but most people, uh, will accept that and it's a fact, uh, and that's how ShellSort gains its efficiency.


[User] Please transcribe this text

[Assistant] Uh, one of the first things you might think of is let's try powers of two. Uh, actually that one doesn't work at all, uh, uh, very well at all because, uh, it winds up not comparing elements in even positions with elements in odd positions until the one sort, which means performance can be bad.


[User] Please transcribe this text

[Assistant] Shell's original idea was to try powers of 2 minus 1, uh, and that works okay.


[User] Please transcribe this text

[Assistant] And that's good because it's easy to compute. When we're using in shell sort of course, we find the largest increment less than our file size and then do the sorts for decreasing values of that increment.


[User] Please transcribe this text

[Assistant] Uh, but finding, uh, the best increment sequence is a research problem that has confounded people for quite a long time. Uh, here's an increment sequence, uh, that I found, uh, after maybe a year's work, uh, and it works, uh, well, but nobody knows if that's, uh, the best one.


[User] Please transcribe this text

[Assistant] Then, uh, next time we need an increment, we just divide by 3, 364, integer divided by 3, 364, integer divided by 3 gives 121, 40, and so forth. So this h equals h over 3 gets us to the next increment.


[User] Please transcribe this text

[Assistant] And then the implementation is just insertion sort. We just go through, uh, starting at H, uh, for I, uh, and when we do the insertion, the J loop, we, uh, decrement J by H each time. Otherwise, the code is exactly like insertion sort.


[User] Please transcribe this text

[Assistant] So just adding this extra loop for H sorting and this extra loop to compute the increments to insertion sort, we get a slightly more complicated piece of code, but it's much, much more efficient.


[User] Please transcribe this text

[Assistant] Here's what it looks like for, uh, a bigger array. We start with, uh, randomly ordered input. Uh, and you can see that it gets more and more in order, uh, on each time that we h sort for the decreasing values of h.


[User] Please transcribe this text

[Assistant] Here's an animation. This animation does the whole H sort for each sub-array. It gives a little better feeling for what's going on.


[User] Please transcribe this text

[Assistant] And now it did the high ones pretty quickly, and now it's doing the one sort. And again, it zips through the array pretty quickly. If it's partially sorted, it doesn't make much difference. It does the higher order sorts a little bit faster.


[User] Please transcribe this text

[Assistant] Now the analysis of shell sort, uh, is still open. Uh, there's a few things that we can say. Uh, for example, we can say that the number of compares in the worst case is big O of n to the 3 halves for the 3x plus 1 increments.


[User] Please transcribe this text

[Assistant] Uh, problem is nobody knows an accurate model for describing the number of compares taken by shell sort for any interesting, uh, increment sequence. They seem to be with a small value, multiple of n times the number of increments used.


[User] Please transcribe this text

[Assistant] So why are we interested in this algorithm? Well, it's a simple idea that leads to substantial performance gains. It's very useful in practice because it's pretty fast except for very huge arrays. It's going to beat even the classical sophisticated methods for medium size arrays. And it doesn't take much code.


[User] Please transcribe this text

[Assistant] It's often used in embedded systems or in hardware sort type systems because there's so little code involved to implement it.


[User] Please transcribe this text

[Assistant] Uh, and it just leads to a lot of interesting questions. This, this gets to the intellectual challenge of developing algorithms.


[User] Please transcribe this text

[Assistant] If you think what we've been studying so far is trivial, go ahead and find a better increment sequence. Try some technique to discover one. And try to say something about the average case performance of shell sort. People have been trying to do that for 50 years without a whole lot of success.


[User] Please transcribe this text

[Assistant] So the lesson is that, uh, we can develop good, good algorithms or good implementations without much code, uh, but there's some out there that are still waiting discovery. It could be that there's some increment sequence out there that makes shell sort more efficient than any other method.


[User] Please transcribe this text

[Assistant] I'm, I'm quickly gaining a new respect for pastry chefs and sweets in general. I'm really enjoying this sort of side of things now.


[User] Please transcribe this text

[Assistant] The first half an hour, I was very nervous and made a couple of silly mistakes, but I guess the proof's in the pudding and I'm interested to see what it looks like inside. I won't get to see, but I hope it's okay.


[User] Please transcribe this text

[Assistant] We become really close over this journey. We become really...


[User] Please transcribe this text

[Assistant] Good mates, and it's hard to cook against your mates, but it's a competition. All that hard work all comes down to this one moment.


[User] Please transcribe this text

[Assistant] I'm definitely going to be pushed for time today. This huge steak is going to take a while to cook and I've also got to do all the other elements as well.


[User] Please transcribe this text

[Assistant] Steak parsnip puree and salsa verde. Nice fresh herby sauce to spoon on top of the steak.


[User] Please transcribe this text

[Assistant] Last time when I cooked a steak over the bachi for Curtis, I won the challenge and got myself an immunity pin.


[User] Please transcribe this text

[Assistant] I keep looking at that steak over there and it needs to get on as soon as I can. It's a massive chunk of meat and it's going to take a while to cook.


[User] Please transcribe this text

[Assistant] Yeah, kind of. I couldn't go past the look of that ribeye. I mean, it looked beautiful. So I'm going to cook it on the bone. Are you cooking it on the hibachi I heard? On the hibachi.


[User] Please transcribe this text

[Assistant] I'm definitely feeling the pressure now. If I mess up this state today, there's a good chance that I'll be going through to round two. It's a massive cut of meat. I'm confident that I can get it done.


[User] Please transcribe this text

[Assistant] Everything is riding on this steak being cooked perfectly. The risk with cooking this steak on the havachi is that it might cook unevenly. Yeah, it's good, good, good.


[User] Please transcribe this text

[Assistant] So I need to watch it like a hawk and make sure the heat is evenly spread throughout the meat.


[User] Please transcribe this text

[Assistant] My steak needs to come off the grill. I need to get it resting.


[User] Please transcribe this text

[Assistant] I think I'm happy with it, but I won't know until the judges slice into it.


[User] Please transcribe this text

[Assistant] Climb's running out, I have to get that steak on the board now. I just hope they love it.


[User] Please transcribe this text

[Assistant] I want the meat cooked medium rare, so I still want some nice pink in there. It's hard, I won't know until the judges cut into it whether it's perfect or not, so there's a lot of pressure on that steak.


[User] Please transcribe this text

[Assistant] I've Yabba Dabba Darned my farmhouse steak. So you've got steak, salsa verde, crispy parsnips, charred coz lettuce and a parsnip mash.


[User] Please transcribe this text

[Assistant] Everything is resting on how this steak is cooked. It needs to be beautiful, pink and juicy.


[User] Please transcribe this text

[Assistant] I'm devastated that the steak isn't perfect all the way through.


[User] Please transcribe this text

[Assistant] Some parts are okay, but okay is just not gonna cut it today.


[User] Please transcribe this text

[Assistant] My eyes are automatically going to one thing. Pairs. Beautiful.


[User] Please transcribe this text

[Assistant] Nicole's really good at her sweets, so it's time to pull out the big guns.


[User] Please transcribe this text

[Assistant] I really want to go through to semi-finals and I've got a second chance to make that happen.


[User] Please transcribe this text

[Assistant] Beautiful. Today I'm doing Earl Grey poached pears with an orange and cardamom ice cream. It looks really nice on the plate with the single whole pear on there, so I'm excited.


[User] Please transcribe this text

[Assistant] They need to be cooked long enough where they're nice and soft. If those pears are hard, that'll be automatically going home.


[User] Please transcribe this text

[Assistant] I know it's risky because I've heard on the grapevine that Gary's not the biggest fan of poached pears, so I'm gonna have some convincing to do today. Poaching pears? Ah, yes, in, um, Earl Grey and some zest. I've got them in as soon as I cook, because they're gonna need as long as I've got.


[User] Please transcribe this text

[Assistant] Next I need to get my ice cream into the churner, so I start juicing the beautiful oranges, get my anglaise done. Yeah, I've had a bit of a success with the orange and cardamom slaver combo before, so just trying to recreate that today. Hopefully I'm onto a winner.


[User] Please transcribe this text

[Assistant] I'm working super fast, just trying to stay super focused on each job that I have to do. There's no room for error. Everything has to go exactly to plan, otherwise I won't get it done.


[User] Please transcribe this text

[Assistant] Also on my dish I'm including an orange and pistachio biscuit. So I quickly get my biscuit mix made, which is sugar and butter, add some flour, pistachios and some orange zest.


[User] Please transcribe this text

[Assistant] And then I roll it out nice and thin and get it into the oven.


[User] Please transcribe this text

[Assistant] Uhm, not really. If they don't soften, what's plan B? I've got nothing, there's a backup. And I'm running out of time. I could be in trouble. On 10.


[User] Please transcribe this text

[Assistant] While my ice cream's churning, my pears are softening, I decide to add a nice surprise element to my dish.


[User] Please transcribe this text

[Assistant] I did have an idea to stuff the pear, stuffing the core with something. So it's just some pistachios, some raisins, some zest, a bit of thyme, and I'm going to chop up some dates and just bind it with some maple syrup and then pipe that in when the pears are done.


[User] Please transcribe this text

[Assistant] I'm doing this pear stuffing on the fly, which probably isn't the smartest idea when this is an elimination and someone's going home, but I've got a good feeling about it.


[User] Please transcribe this text

[Assistant] I get that in a piping bag and sit it aside. My biggest concern is getting these pears cooked. They're gonna take pretty much the whole cook time to become soft enough. You need to be able to eat them with a spoon. So if they're not cooked, there's no point in stuffing it because I'll be going home.


[User] Please transcribe this text

[Assistant] Not much time, it's definitely gonna go down to the wire. My ice cream's in my churner, my biscuit's cooking, my pears are still cooking. If these pears aren't soft, I've really got nothing.


[User] Please transcribe this text

[Assistant] The stress of just waiting, yeaah, it's making me pretty anxious. At this stage, there's not much I can do. I've gotta get everything else done.


[User] Please transcribe this text

[Assistant] I really want this pistachio praline as an extra element that'll make my dish look amazing. I melt some sugar down in a pot, tip that onto a baking tray, then sprinkle it with the roasted pistachio nuts and get that in the blast chiller to cool down.


[User] Please transcribe this text

[Assistant] Looking inside that ice cream churner and it's, it's getting there but it still needs more time.


[User] Please transcribe this text

[Assistant] The main component on my dish is these poached pears. I've left it long enough, I need to get them out. I just hope there was enough time to get them soft.


[User] Please transcribe this text

[Assistant] I fill the pears with the stuffing that I made. Good on ya, Timmy. Good work, mate. I strain the Earl Grey syrup. It's coming together but it's definitely down to the wire. I'm using every last second that I've got.


[User] Please transcribe this text

[Assistant] I look in the ice cream churner and my ice cream's churned. It's amazing. It's set. It's good.


[User] Please transcribe this text

[Assistant] Don't know if this is enough to get in the semi-final.


[User] Please transcribe this text

[Assistant] Today could be the last time that I cook in this beautiful kitchen and I think I'm just gonna take a moment and look around and just soak it all in. It's been one hell of a journey and I don't want it to end.


[User] Please transcribe this text

[Assistant] Taking my dish into the judges, I feel like I can hold my head up high. Gents. But I'm still worried about the pair.


[User] Please transcribe this text

[Assistant] I'm a fighter and we're so close to the end now.


[User] Please transcribe this text

[Assistant] And I don't wanna go home yet, and I'm just gonna keep pushing as long as I can.


[User] Please transcribe this text

[Assistant] That's what I'm here to do now. I'm not here making up numbers anymore. I've got to believe that I can go all the way. And I think I'm finally, finally getting there within myself and getting the confidence. I am, I am good enough and I can achieve things that I've never thought I've been able to achieve before.


[User] Please transcribe this text

[Assistant] The dish today is Earl Grey Poached Pears with a cardamom and orange ice cream and there's a biscuit of pistachio, praline and a syrup.


[User] Please transcribe this text

[Assistant] You might find Snapdragon, Pixie Crunch, Cosmic Crisp.


[User] Please transcribe this text

[Assistant] Jazz or ambrosia next to the more familiar Red Delicious and Granny Smith.


[User] Please transcribe this text

[Assistant] These delightfully descriptive names belong to just a handful of the over 7,500 apple varieties in the world.


[User] Please transcribe this text

[Assistant] Fruit breeding is a way to fulfill the expectations of farmers and consumers who seek specific qualities in an apple.


[User] Please transcribe this text

[Assistant] On the one hand, farmers may want them to be disease resistant and to store well.


[User] Please transcribe this text

[Assistant] To create apples with desirable characteristics, breeders first need to find parent apples that carry those characteristics. Once the parents have been selected, they have to wait until the trees bloom in the spring.


[User] Please transcribe this text

[Assistant] The breeder takes the pollen from one bloom called the father and transfers it by hand to the other parent bloom called the mother through a process called cross pollination.


[User] Please transcribe this text

[Assistant] It takes about five years for these seeds to grow into trees that produce apples. But because of the way traits are inherited, all of the seedlings produced will have different sets of genes and characteristics.


[User] Please transcribe this text

[Assistant] This means that to achieve a desired quality, it takes a lot of offspring, not to mention patience on the breeder's part.


[User] Please transcribe this text

[Assistant] When a seedling does bear fruit with the desired qualities, it's selected for further evaluation.


[User] Please transcribe this text

[Assistant] Of the original crossed seedlings, about one in every 5,000 makes it to this prestigious stage.


[User] Please transcribe this text

[Assistant] They're then sent to new farms where breeders can assess how various climates and soil types affect the plant's growth.


[User] Please transcribe this text

[Assistant] The fruit of the seedling and its many clones must then be collected and sampled to ensure consistency.


[User] Please transcribe this text

[Assistant] Breeders study about 45 traits in an apple, like the texture and firmness of the flesh, when it ripens, how sugary its juice is, and how long it stays fresh.


[User] Please transcribe this text

[Assistant] Over several years they weed out all the bad apples, selecting only those whose fruits are the best.


[User] Please transcribe this text

[Assistant] These exclusive plants officially form the cultivar, or new apple variety.


[User] Please transcribe this text

[Assistant] To ensure an exact copy of this cultivar, all apple trees must be grafted from the original seedling.


[User] Please transcribe this text

[Assistant] Branches, called scion wood, are cut from the original tree and grown to generate more scion wood.


[User] Please transcribe this text

[Assistant] Segments of these trees are then grafted onto rootstock. That's the lower section of another tree that's been chosen from a different cultivar for its superior roots and growing ability.


[User] Please transcribe this text

[Assistant] Finally, this fusion creates a new apple tree with the desired qualities.


[User] Please transcribe this text

[Assistant] Each new plant takes up to four years before it starts producing the fruit we eat.


[User] Please transcribe this text

[Assistant] Apple breeding may be a difficult art, but it's accessible to all.


[User] Please transcribe this text

[Assistant] Universities, companies, and even individuals can create new cultivars.


[User] Please transcribe this text

[Assistant] But to fully own an apple, the breeder faces a final challenge, naming the fruit.


[User] Please transcribe this text

[Assistant] After a cultivar is patented, a breeder chooses a name for its trademark.


[User] Please transcribe this text

[Assistant] That final step grants them long-lasting rights over the apple and its clones.


[User] Please transcribe this text

[Assistant] That name must be completely original, and the catchier the better, of course.


[User] Please transcribe this text

[Assistant] The more we work with nature's bounty to breed new cultivars, the more creative and delectable these names will become.


[User] Please transcribe this text

[Assistant] The opportunity that it's given me to do things that I really really love. I think MasterChef can definitely make dreams come true.


[User] Please transcribe this text

[Assistant] Seeing the judges and seeing the previous winners was amazing. I didn't think I'd get so fangirly.


[User] Please transcribe this text

[Assistant] This is MasterChef10 and I, so I'm seeing dishes that I don't think I've ever seen anywhere before. And at the same time, nerves are just going through the roof.


[User] Please transcribe this text

[Assistant] Um, brooding island wallaby that's crusted with Tasmanian wild paperberry with lemon myrtle, baby beets and some wild mushrooms.


[User] Please transcribe this text

[Assistant] My pills haven't worked. They worked so well at home.


[User] Please transcribe this text

[Assistant] Oh my gosh. Oh, look at that. That's so pretty. Oh, who the yum. Nailed it.


[User] Please transcribe this text

[Assistant] A sesame praline, and it's also got some compressed fruit.


[User] Please transcribe this text

[Assistant] To deliver dishes worthy of the title. You wouldn't expect any better in a great restaurant.


[User] Please transcribe this text

[Assistant] Yeah? Yeah, so careful. Because he's watching you. Nah, great to be back. I'm Tom.


[User] Please transcribe this text

[Assistant] We don't ask you often, but what a feeling. When you walked in this kitchen in the top 24, how different did you feel then compared to how you feel now? How far you have come? We can see it. The question is, do you recognise it in yourselves? What about you Tessa?


[User] Please transcribe this text

[Assistant] I think it's a little understated, Tim. You look at that beautiful little lambington that you put up yesterday. How many techniques, how many applications you expressed in that tiny little dessert. Beyond, I'm sure, what you would have imagined 11 weeks ago.


[User] Please transcribe this text

[Assistant] So today you're cooking for an advantage in tomorrow's challenge.


[User] Please transcribe this text

[Assistant] Trust us, you all wanna be there because today's advantage could be the thing that gets you there.


[User] Please transcribe this text

[Assistant] Oh, a couple of different strategies. The other three are writing a plan.


[User] Please transcribe this text

[Assistant] Grilled prawns, stuffed prawn heads. Yeah. I'm liking the idea of the different corn elements. Yeah, like that. And the spice mixture. And then the avocado mousse.


[User] Please transcribe this text

[Assistant] Because it depends how sophisticated you want it to look. Yeah, I want it to look nice and beautiful on the plate. Alright. I can hear Matt Reston screaming.


[User] Please transcribe this text

[Assistant] Alrighty, Marissa. Hello. We're curious about this one because it's some nice flavour combinations. Pear, plaster, chocolate, grain. Tell me what the elements are.


[User] Please transcribe this text

[Assistant] Yeah, okay. I remember very early on you doing a pear dessert and I was telling you that


[User] Please transcribe this text

[Assistant] Oh, look at those. They came out well. Did you do the pear as well? Did it work?


[User] Please transcribe this text

[Assistant] I've got your, uhm, this is your tarragon oil here as well, isn't it?


[User] Please transcribe this text

[Assistant] You know, one of the dishes we just went, wow, you know, we've got some good cooking today. Yeah. It's an important advantage, uh, of crabs. I know. It's just like cooking their hearts out, doing some great food. Let's dress the dish. Okay.


[User] Please transcribe this text

[Assistant] The nettle puree is delicious. It's got some serious flavour. And actually the mushroom stock, the sauce, is very good.


[User] Please transcribe this text

[Assistant] But, you know, you tell me something like porridge, I'm thinking of it's like a big cuddle. You know, it's like a wintery warm cuddle. That just feels like a...


[User] Please transcribe this text

[Assistant] You know, what the foundation of that dish is really good. She's just trying too hard.


[User] Please transcribe this text

[Assistant] I think she's put a lot of effort into things that she left off the plate and wasted a lot of time. And I had roast chicken the other night and I just chucked it on the spit, took the dogs for a walk, came back and it was moister than that. No, and it wasn't paying any attention to it at all.


[User] Please transcribe this text

[Assistant] And I thought she'd cook this really well, but actually I think the temperature of the oven was too high, and yet strangely she hasn't got as crispy skin, so, I don't know.


[User] Please transcribe this text

[Assistant] That is absolutely beautiful. She has put up some, cause when you start thinking about it, she's put up some amazing desserts. And the clarity of those desserts has got better and better as we've...


[User] Please transcribe this text

[Assistant] Kind of peeking into this point of the competition. You wouldn't expect any better in a great restaurant.


[User] Please transcribe this text

[Assistant] Hey everyone, it's Jennity and welcome back to my channel. This story ain't over. So we are in September and I cannot believe it. There are only four months left of 2021. I feel like it's still 2020.


[User] Please transcribe this text

[Assistant] Years now and I actually bought the book last year and I didn't get around to reading it. It is a bit of a...


[User] Please transcribe this text

[Assistant] slipping quickly out of her fingers. But then she is visited by a strange benefactor who basically is willing to make her a deal that will help her get everything that she wanted.


[User] Please transcribe this text

[Assistant] Because they are going to be reading Oswell by Mona Awad. So I was like, yes, sign me up. So yeah, I'm going to be reading this in September and then I think the live show is going to be around the beginning of October. So you guys can look forward to that and hearing my thoughts and also I think Erin from Booked and Busy and also Kayla's thoughts from Books and Lala.


[User] Please transcribe this text

[Assistant] Continuing on our tour of applications of coding methods and information theory. In this video, we're going to take a look at some applications and examples of error correction codes. So just to remind you of the terminology here, error correction coding is also referred to as channel coding.


[User] Please transcribe this text

[Assistant] In the previous video, we were looking at these different applications of compression codes, and compression coding is also referred to as source coding. So, you can start getting familiar with that terminology.


[User] Please transcribe this text

[Assistant] Alright, so what are, what are some examples of error correction codes? Well, the first, there's no other place to start than with... Hamming. Hamming codes.


[User] Please transcribe this text

[Assistant] So in 1950, Richard Hamming introduced a really elegant family of error correction codes, which we now refer to as Hamming codes.


[User] Please transcribe this text

[Assistant] Before Hamming, there existed some, some, you know, sort of primitive, some basic techniques for error correction like parity checks and, and repetition codes. But,


[User] Please transcribe this text

[Assistant] Uh, they, they were not really, they didn't really do a very good job. And Hamming came along and introduced his family of codes. And they really jump-started the field of error correction coding. Sometimes people call it, or write it E-C-E-C.


[User] Please transcribe this text

[Assistant] These were sort of the first reasonably good error correction codes.


[User] Please transcribe this text

[Assistant] Now, you know, not too long after that, so they were sort of the state of the art for a while, but not too long after that, people came up with better techniques, and now there exists way, way better techniques than Hamming codes, but they are still used for certain applications.


[User] Please transcribe this text

[Assistant] So one application of Hamming codes that is in use today is in RAM.


[User] Please transcribe this text

[Assistant] So if you have a computer of any sort, a desktop or a laptop or notebook computer,


[User] Please transcribe this text

[Assistant] Or even something like a, you know, like a PS3, Playstation 3, or Xbox 360, or Wii gaming system. They all have RAM.


[User] Please transcribe this text

[Assistant] And what is RAM? RAM is the, the main memory of your computer. In other words, it's sort of the, the dynamic memory. In fact, this is called, these are called DRAM for dynamic RAM.


[User] Please transcribe this text

[Assistant] So this is, uh, in contrast to the static RAM, which is sort of the stored memory. This is, this is the main memory that is actively being used in your computer while you're using it.


[User] Please transcribe this text

[Assistant] Not on the hard disk. And it's stored in these little chips, these DRAM chips.


[User] Please transcribe this text

[Assistant] And now you may be wondering, now, what in the world, you know, you were talking about, uh, you know, error correction is reliable transmission of information.


[User] Please transcribe this text

[Assistant] This is not an error-free process. Reading and writing from chips like this is not an error-free process. Because there are little magnetic fluctuations and, and you know, little electromagnetic variations that can come along and, and


[User] Please transcribe this text

[Assistant] Mess up the, the stored information on these chips.


[User] Please transcribe this text

[Assistant] And so you can have errors, you know, you, you take your file, you write it to the chip and then later you want to read it back and you get the wrong thing. And so you have to be able to correct for those little errors that, that, that occur.


[User] Please transcribe this text

[Assistant] And Hamming codes are one way that are used to, to, to do that for these DRAM chips.


[User] Please transcribe this text

[Assistant] Another way, sort of actually somewhat related, is for static memory. And one way that people, if you really care about the integrity of your data, then you might use a RAID system.


[User] Please transcribe this text

[Assistant] And one of the lower level, I don't know if I'm not an expert in this, I don't know if people actually use Raid 2.


[User] Please transcribe this text

[Assistant] Raid 2 is sort of a low level, sort of more primitive type of raid. There are better, more sophisticated raid type of schemes. But Raid 2 uses Hamming codes. And here you have what you do is you have seven hard disks. There's seven disks here rather than just like one.


[User] Please transcribe this text

[Assistant] And the data that you have is stored on these disks in a way that has some redundancy.


[User] Please transcribe this text

[Assistant] So that if you were to lose any one, if any one of the disks just died, just completely went kaput, then you could still recover your data, uh, all of your data without any errors.


[User] Please transcribe this text

[Assistant] So that's the, a feature of the, what's called a 7-4 Hamming code is that you can lose any one of the bits out of seven, out of seven bits, you can lose any one bit and still recover your data without any errors.


[User] Please transcribe this text

[Assistant] So these are some applications of hamming codes that are still in use today.


[User] Please transcribe this text

[Assistant] It turned out not too long after Hamming came along, people got, well, were very encouraged by that, and they began to develop a whole series of different error correction codes. And, uh, one family of such codes is called BCH codes, and perhaps the most widely used, sort of the gold standard,


[User] Please transcribe this text

[Assistant] An error correction coding for many years was


[User] Please transcribe this text

[Assistant] Get rid of that little piece there. Reed Solomon codes. Reed Solomon. Introduced by Reed and Solomon. And these were introduced in 1960. So only 10 years after Hamming's original


[User] Please transcribe this text

[Assistant] Original introduction of the Hamming codes. Reed and Solomon came along, and they developed a really, really sort of fancy mathematical technique using abstract algebra to do error correction codes.


[User] Please transcribe this text

[Assistant] And Reed Solomon codes are often combined with convolutional codes. And so, so what's, what's called RSV.


[User] Please transcribe this text

[Assistant] The V stands for Viterbi Algorithm. The convolutional part involves a Viterbi Algorithm.


[User] Please transcribe this text

[Assistant] These RSV codes were the gold standard for many, many years.


[User] Please transcribe this text

[Assistant] And uh, and so they had, they have a huge number of applications that have developed over the years. And here are just a few of them.


[User] Please transcribe this text

[Assistant] So barcodes, maybe I'll, so you can still see Raid Salomon, barcodes


[User] Please transcribe this text

[Assistant] I mean, just, I don't know if it's every version, but a huge number of versions of barcodes use Reed Solomon error correction coding techniques so that if part of the barcode, you know, like if part of it got like ripped off or something like that,


[User] Please transcribe this text

[Assistant] Where it just became unreadable for some reason, you could still read the code. So you know, if, uh, you know, you're checking out at the supermarket, then they could still actually read what was supposed to be on the barcode.


[User] Please transcribe this text

[Assistant] Reed Solomon, uh, uses, uh, so, uh, barcodes use Reed Solomon. Also, any CD, DVD, or Blu-ray disc uses Reed Solomon codes also.


[User] Please transcribe this text

[Assistant] So, every time you use a CD, you know, DVD, uh, Blu-ray, you're using Reed Solomon codes.


[User] Please transcribe this text

[Assistant] And they're particular, so one aspect of Reed Solomon that's very nice is that they're very robust to what are called burst errors. So if you have a burst of, a sequence of errors that all occur very, you know, one right after the other,


[User] Please transcribe this text

[Assistant] Then they can be handled very well by these sort of Reed-Solomon codes. And this kind of error can come up in


[User] Please transcribe this text

[Assistant] For example, in a CD, if you have a scratch that goes along the direction of the, the way that the information is stored. So these can correct up to 4000 bits, uh, that were lost due to a scratch.


[User] Please transcribe this text

[Assistant] Another application is in DSL. DSL lines if you get your internet over the telephone lines.


[User] Please transcribe this text

[Assistant] DSL uses Reed Solomon codes and also for many, for several years, if you had digital video, uh, you know, in terms of your TV, if you had digital, digital TV, it was probably using Reed Solomon codes because that was part of the, the DVB standards for, for digital TV.


[User] Please transcribe this text

[Assistant] More recently there have been, uh, actually the, the, the newer versions of digital video broadcasting standards are starting to use some more modern codes that have been, that have been developed and I'll mention in a little bit below.


[User] Please transcribe this text

[Assistant] And one other computer application of Reed Solomon is in RAID 6. So this is, so this is.


[User] Please transcribe this text

[Assistant] So we saw that, uh, you know, Hamming was used in Raid 2, and...


[User] Please transcribe this text

[Assistant] And Reed Solomon is used in RAID 6. So this is an example of, you know, you've got a bunch of hard disks here and your information is being stored in a way that is there some redundancy so you can recover your data if bad things happen to some of, some of these disks.


[User] Please transcribe this text

[Assistant] And some really cool applications of Reed Solomon codes are to space exploration. So all of these space exploration missions used Reed Solomon codes. So the first one here.


[User] Please transcribe this text

[Assistant] Is Voyager. This is Voyager. The Voyager 1 and 2.


[User] Please transcribe this text

[Assistant] Probes that went to Jupiter, Saturn, Uranus and Neptune.


[User] Please transcribe this text

[Assistant] So that you could recover any errors that were introduced during the transmission across those, you know, huge number of miles, the vastness of space in which those transmissions


[User] Please transcribe this text

[Assistant] were sent and one, you know, very famous image here. This is the pale blue dot image.


[User] Please transcribe this text

[Assistant] Which, uh, was so named probably I think by Carl Sagan. And this is a very famous picture. Because if you can make it out, there's this very tiny little dot here. And that dot is Earth!


[User] Please transcribe this text

[Assistant] That is Earth as seen from beyond Neptune. So once, uh, once the Voyager, I think it was Voyager 1 took this picture from when it was beyond Neptune and that is Earth right there.


[User] Please transcribe this text

[Assistant] The fact that we, and that represented less than one pixel in this image.


[User] Please transcribe this text

[Assistant] If we, if it were not for the capacity of these error correcting codes,


[User] Please transcribe this text

[Assistant] There is no way that we would have been able to get a picture of the required resolution and low enough error that you could actually make out Earth in this picture. Cause it's only one pixel. If you had errors, then you would never be able to see where Earth was. Or make it out at least.


[User] Please transcribe this text

[Assistant] So that is pretty cool, and that would not be possible without these error correcting codes.


[User] Please transcribe this text

[Assistant] Perhaps even more amazing, the Voyager probes are still alive and they're still sending back images. So I think it was just a year ago, one of them sent back a picture of the solar system.


[User] Please transcribe this text

[Assistant] And now, Voyager 1 is the farthest out, and it's 17...


[User] Please transcribe this text

[Assistant] That's around 11 billion miles from Earth. And still using these amazing error correcting codes, they're able to send back pictures over those billions of miles. And we can still get those pictures back here. So that's Voyager. And then here, this one is Galileo. Galileo. Galileo was a mission to Jupiter.


[User] Please transcribe this text

[Assistant] What else do we have? Uh, let's see. Oh, right. So this one here, this is the Cassini Huygens. Cassini.


[User] Please transcribe this text

[Assistant] Huygens probe. And this was a mission to Saturn. Also used Breed Solomon codes.


[User] Please transcribe this text

[Assistant] And maybe just to give you, give you a sense of the timelines here. So Voyager was in 19, it was launched in 1977.


[User] Please transcribe this text

[Assistant] Cassini was launched in 1997.


[User] Please transcribe this text

[Assistant] And then also, so now we have the Mars missions. So this was, this was the Sojourner Rover from the Mars Pathfinder program. So this is Pathfinder.


[User] Please transcribe this text

[Assistant] And this was launched in 1996.


[User] Please transcribe this text

[Assistant] And this also used Reed Solomon codes. This is actually a picture of the rover on Mars. Pretty cool.


[User] Please transcribe this text

[Assistant] So this picture was probably encoded using Reed Solomon codes. I should mention that these two here are artist conceptions. These two Galileo and Cassini, these are not actual pictures of the probes. These are artist conceptions and this is, I'm not sure if this might be a real picture on earth or something.


[User] Please transcribe this text

[Assistant] This is, but this is a real picture on Mars. And then, more recently, the Mars exploration rovers, MER, these were launched in 2003.


[User] Please transcribe this text

[Assistant] And we had those, the two rovers, Spirit and Opportunity. And this is also an artist conception of, of one of them.


[User] Please transcribe this text

[Assistant] Spirit is dead, but opportunity is still alive and operating.


[User] Please transcribe this text

[Assistant] Sending back images. And here is actually a picture. This is a real picture from Mars of, uh, the sort of panorama of Mars. And I mean, that's a pretty darn high resolution picture. That's a pretty nice picture. So this was probably encoded using Reed-Solomon codes.


[User] Please transcribe this text

[Assistant] So Reed Solomon Codes had a huge number of applications over the years.


[User] Please transcribe this text

[Assistant] But, uh, there was still some improvement to be made. So the channel coding theorem, which tells us the best error correction


[User] Please transcribe this text

[Assistant] So the best that we can do for error correction that was proved by Shannon in 1948, these are, there's still a ways to go to get close to the Shannon limit. And so it turned out that


[User] Please transcribe this text

[Assistant] In 1993, a group of French, uh, French communications experts, communications engineers, shocked the world when they introduced turbo codes. Turbo codes, so.


[User] Please transcribe this text

[Assistant] Introduced by, and I'm sure I'm going to mispronounce some of these names, by Beru, Glavio, and Thitimachima.


[User] Please transcribe this text

[Assistant] We're introduced and turbo codes were astonishingly good. They came very, they were able to get much, much closer to the Shannon limit of how well you could do with an error correction code than anyone had been able to do so far. And so,


[User] Please transcribe this text

[Assistant] Turbo codes are now, and some of their, some close on the heels of turbo codes, uh, were Gallagher codes, low density parity check codes really came into their own and were shown to be competitive with turbo codes. But these are now, turbo codes and Gallagher codes are now the state of the art.


[User] Please transcribe this text

[Assistant] In, uh, error correction codes. And so these have a huge number of applications. So turbo codes have been, uh, are


[User] Please transcribe this text

[Assistant] Throughout the 3G and 4G standards. So if you have a, you know, like an iPhone or an iPad or, or an Android.


[User] Please transcribe this text

[Assistant] And you, or just, you know, a computer, and you use 3G or 4G for wireless internet access, you are using turbo codes. And turbo codes are what


[User] Please transcribe this text

[Assistant] Enable you to get your data at such a high rate. That is, that was the improvement, that was the, the, perhaps, no, there might have been a couple other things, but that was perhaps the most important contribution to being able to get your data at a higher rate.


[User] Please transcribe this text

[Assistant] So 3G, 4G, couple applications. Let's see what else. Things like LTE, if you've heard of these things, LTE media flow.


[User] Please transcribe this text

[Assistant] Mediaflow, I think that's actually discontinued. WiMAX, these all use turbo codes.


[User] Please transcribe this text

[Assistant] And more recently, so now that these sort of, these sort of new and improved air correction codes have come, have come out, NASA is switching over to using them. So the most recent Mars mission, the Mars reconnaissance orbiter, which was launched in 2005, this uses turbo codes.


[User] Please transcribe this text

[Assistant] And this is really cool because they are able to send back very high resolution images. So one of the instruments on there is called the Hi-Rise. They have a whole bunch of other instruments also.


[User] Please transcribe this text

[Assistant] This is so cool just to give you a sense of how high resolution these, these images can be.


[User] Please transcribe this text

[Assistant] These are the tracks of one of the rovers, one of the previous rover missions. These are the tracks left by the rover. And this Mars Reconnaissance Orbiter was able to get a picture of the tracks. I mean, these rovers are not very big.


[User] Please transcribe this text

[Assistant] So I think it's down to like, you know, 0.3 meter resolution. And another cool, uh,


[User] Please transcribe this text

[Assistant] Actually, just very recently, like a month or so ago, NASA announced, as you know, when I'm filming this video, NASA announced that they were able to get these pictures, the sequences of pictures, that seem to indicate the presence of flowing water on Mars, which is a huge deal, because uhm,


[User] Please transcribe this text

[Assistant] You know, they've detected, well, actually using, you know, this


[User] Please transcribe this text

[Assistant] Uh, perhaps primarily, this Mars reconnaissance orbiter, they've detected that there's a huge quantity of water ice.


[User] Please transcribe this text

[Assistant] Okay, so let's see, where is this thing? Okay, so, okay, so here we go. So this is a sequence of these very high resolution images, and they were transmitted using turbo codes.


[User] Please transcribe this text

[Assistant] Uh, from the Mars Reconnaissance Orbiter, and you see these little, these little things, so it starts out here and now it looks like this is sort of growing, this sort of, looks like this, they think this is flows of, of, of water, of liquid water. But it's very cold liquid water, it's like very salty.


[User] Please transcribe this text

[Assistant] Uh, liquid water, that's why it flows very slowly. Okay, anyway. I thought that was super cool.


[User] Please transcribe this text

[Assistant] And so I mentioned that following closely on the heels of turbo codes, there was yet another, another class of error correction codes that was discovered that also have very good performance. So that was turbo codes. And now,


[User] Please transcribe this text

[Assistant] Our last stop on the tour is Gallagher codes. Let me switch colors. That's kind of weird. Gallagher codes.


[User] Please transcribe this text

[Assistant] Which are also called low-density parity check codes.


[User] Please transcribe this text

[Assistant] And these codes were originally discovered by Robert Gallagher published in his, his PhD thesis in 1960 at MIT, MIT.


[User] Please transcribe this text

[Assistant] And even though Gallagher was, he went on to become a very famous communications, uh, you know, a mathematician working in, in this area, communications and information theory.


[User] Please transcribe this text

[Assistant] His, his codes were forgotten. They were, they seemed to be too inefficient for the computers of the time. And so they, they were seen to be, to just be impractical. And so people forgot about them for a number of years, for nearly 40 years. And then,


[User] Please transcribe this text

[Assistant] Not long after TurboCodes came out, it was around 1995 or 96, somewhere around there.


[User] Please transcribe this text

[Assistant] David McKay and Radford Neal rediscovered Gallagher's codes and found that they performed extremely well as well as turbo codes and in some cases even better.


[User] Please transcribe this text

[Assistant] Uh, then, then turbo codes. And so low density parity check codes and turbo codes are, are sort of at the forefront, the state of the art of these, these error correcting codes.


[User] Please transcribe this text

[Assistant] And it's really remarkable because they, they can come very, very close to the optimal limit of what you can possibly do with an error correcting code.


[User] Please transcribe this text

[Assistant] And furthermore, they can do it very computationally efficiently, which is just amazing. It's just so cool. So cool. Okay, so anyway, so what are some applications of these Gallagher codes? Well, the first


[User] Please transcribe this text

[Assistant] This is a picture here of a server farm. This is a Facebook server farm. I found a picture of one of the server farms used by Facebook and this is every single blue dot in this picture is a server. It's a computer. And this is one row.


[User] Please transcribe this text

[Assistant] Out of, I think, four or so that are at this server farm.


[User] Please transcribe this text

[Assistant] These, these Gallagher codes are used in this sort of application for very high speed Ethernet.


[User] Please transcribe this text

[Assistant] So 10 gigabit per second ethernet.


[User] Please transcribe this text

[Assistant] And they have even higher ones now. Uses Gallagher codes.


[User] Please transcribe this text

[Assistant] And, you know, again, you know, you, you may be wondering, you know, if I'm just transmitting over this, this silly little, this little cable from, from, from one part of a room to another part of a room, why would I need an error correcting code? Well, that silly little ethernet cable is just a copper wire.


[User] Please transcribe this text

[Assistant] And things can get messed up as the little electrons flow along the copper wire. And so errors can be introduced in your, your ethernet packets and you need to correct for those errors. And if you're going to have very, very high speed internet, you need to have, you need to be communicating at a very high rate.


[User] Please transcribe this text

[Assistant] And so you need to be able to, to have a good error correction code with very high rate.


[User] Please transcribe this text

[Assistant] So this is one application of these low density parity check codes. Another one is wifi. Some of the newer, some of the newer wifi standards like 802.11n uses these low density parity check codes.


[User] Please transcribe this text

[Assistant] And another, a really cool sort of internet application is actually


[User] Please transcribe this text

[Assistant] Internet over power lines. So here this is just, you know, your standard sort of wall electrical outlet.


[User] Please transcribe this text

[Assistant] And it is actually possible now for you to get internet through your wall outlet. So you could, you can just plug in some device that is appropriately equipped.


[User] Please transcribe this text

[Assistant] Assuming that you're, you're whatever, I don't know what you call it, your power slash, uhm, internet provider has that, that capacity. And, uh,


[User] Please transcribe this text

[Assistant] One of the, one of the standards for, for doing this is called ITUGHHN.


[User] Please transcribe this text

[Assistant] And, uh, this is particularly applicable say for like consumer electronics, you know, you have like a smart.


[User] Please transcribe this text

[Assistant] You know, if you want to have a very energy efficient power grid, then being able to control things, you know, by uhm, by internet, so to speak, would be very useful.


[User] Please transcribe this text

[Assistant] Okay, so that's a, that's a really neat application and this uses these Gallagher codes.


[User] Please transcribe this text

[Assistant] Yet another application, modern application. Well, they're all modern.


[User] Please transcribe this text

[Assistant] So before we were talking about DVB, how DVB used the Reed-Solomon codes.


[User] Please transcribe this text

[Assistant] And some of the later versions, well in particular, the S2 standard DVB standard uses these Gallagher codes. And this one, S stands for satellite. So if you had, you know, you may have had


[User] Please transcribe this text

[Assistant] Uhm, digital television reception via satellite before.


[User] Please transcribe this text

[Assistant] And that would probably have used a DVB standard.


[User] Please transcribe this text

[Assistant] But now if you have HDTV over satellite, your, you know, chances are you're using this DVB S2 standard. And the one, one of the key technologies, one of, I think maybe two key technologies that enables you to get HDTV over satellite is these Gallagher codes.


[User] Please transcribe this text

[Assistant] So it would not have been possible to get HDTV over satellite without this significant improvement in error correction coding.


[User] Please transcribe this text

[Assistant] And one last, our very last application here.


[User] Please transcribe this text

[Assistant] Is, uh, is in some standards that are being used in China.


[User] Please transcribe this text

[Assistant] So CMMB, which stands for China Multimedia Mobile Broadcasting, is used for handheld, it's basically, you know, transmission of a video, uh, a video type of content from satellites to handheld devices. And they use Gallagher codes, or LDPC codes.


[User] Please transcribe this text

[Assistant] And another one, so that's for handheld. And then, and then they also have one called DTMB.


[User] Please transcribe this text

[Assistant] Which is for, you know, like regular televisions and stuff like that. And they also use Gallagher codes.


[User] Please transcribe this text

[Assistant] And they use, so that would be for like HDTV and stuff like that.


[User] Please transcribe this text

[Assistant] Okay, so we at long last have come to the end of our tour of all these applications and I hope that you found that useful to sort of get a feel for just the incredible array of applications of these technologies and, uh,


[User] Please transcribe this text

[Assistant] Hopefully these will, these examples will take these things which may have otherwise been sort of just abstract, abstract concepts and, and really illustrate, you know, in, in your mind for you to, to think about, hey, you know, whenever I'm using my, my iPhone, I'm using these, these, uh, you know, these technologies.


[User] Please transcribe this text

[Assistant] And so, so, uh, hopefully you'll, you have gained an appreciation now for how ubiquitous these things are. And, uh, these, these examples will, will give you a way to sort of concretely think about what these are being used for.


[User] Please transcribe this text

[Assistant] Alright, so that was, that was, that completes our tour. We talked about in the error correcting codes, we had the Hamming codes, we had the Reed-Solomon codes, Turbo codes, and Gallagher codes.


[User] Please transcribe this text

[Assistant] To me, it's just, it's really stunning how ubiquitous these are. I just, I mean, they're just integrated into the, the tools that we use every day. And they're really, really an essential part of these tools that we use on a day to day basis.


[User] Please transcribe this text

[Assistant] Alright, so I found this really fascinating to see all these, these applications and I hope that, I hope that you did too.


[User] Please transcribe this text

[Assistant] Every minute for months since I've been here has led to this very moment. I've been dreaming of this day.


[User] Please transcribe this text

[Assistant] So no matter what the challenge is, I'm going to do whatever I can to make it through today.


[User] Please transcribe this text

[Assistant] I know everyone wants this, but I want more and I want to push harder.


[User] Please transcribe this text

[Assistant] I'm sorry in advance. That can't be good.


[User] Please transcribe this text

[Assistant] Gosh, there is nowhere to hide in this dessert. There's only few elements and you've got to perfect everything. And we're just making one. Yep.


[User] Please transcribe this text

[Assistant] I was secretly hoping that today's challenge would be a dessert challenge. And right now I need to whip up the egg whites for the white coral.


[User] Please transcribe this text

[Assistant] Alright. Yeah I just took the egg whites a bit too far. So it's harder to fold through. They've turned into firm peaks.


[User] Please transcribe this text

[Assistant] And it's very lumpy. And I'm really scared that if I don't get these lumps out without knocking all the air out, this mousse could be a disaster. But I've got no choice. I have to use it. I've got no time.


[User] Please transcribe this text

[Assistant] Finally, I've got all the lumps out and I'm hoping so badly that I didn't knock out all that air from that white chocolate mousse.


[User] Please transcribe this text

[Assistant] Otherwise I'll be left with a really dense curl.


[User] Please transcribe this text

[Assistant] And I'm a bit stressed right now because I don't know if I've stuffed up my white chocolate mixture for the white coral that's in the blast chiller. But right now, I can't think about that. I've just gotta focus and keep going.


[User] Please transcribe this text

[Assistant] Nice tears. Come on, Laurie, come on. Come on, darling. I feel like I'm really behind and I'm rushing everything.


[User] Please transcribe this text

[Assistant] And I've just realized that I've made a huge mistake. Ugh.


[User] Please transcribe this text

[Assistant] But I haven't taken the prune juice out to cool down. And I don't have time for it to cool down.


[User] Please transcribe this text

[Assistant] And it's separated. That's not good.


[User] Please transcribe this text

[Assistant] It's lumpy, it's not combining. Oh my gosh. This is a complete disaster.


[User] Please transcribe this text

[Assistant] I've just realized that I haven't taken the prune juice out to cool down.


[User] Please transcribe this text

[Assistant] So I've gotta just add this cooking liquid into the ice cream mix. It's probably gonna affect it now, I reckon. Oh my gosh. And...


[User] Please transcribe this text

[Assistant] It's separated. It's lumpy. It's not combining. Oh my gosh. This is a complete disaster. Ah, I don't know. I think I have to stir it through.


[User] Please transcribe this text

[Assistant] And it looks like it's still not working. I'm just gonna let this ice cream churn and hopefully it'll get rid of all the lumps. I've gotta get on to making my chocolate ganache right now.


[User] Please transcribe this text

[Assistant] But at the moment, I've got two things that are really worrying me. My ice cream could be lumpy, and my white coral might have all the air knocked out of it. And that really, really worries me.


[User] Please transcribe this text

[Assistant] Now I've gotta make sure that I've got all the other elements ready for service.


[User] Please transcribe this text

[Assistant] But surprisingly, it looks actually okay to me.


[User] Please transcribe this text

[Assistant] I don't know what my white chocolate mousse is like, so I'm really scared of the coral piece of that dessert, which is the center of this dessert. And the grand final is tomorrow, it's almost there, and I feel like if I go home today, then that would just be devastating.


[User] Please transcribe this text

[Assistant] That cook was the fastest cook of my life. I feel like I've aged a few years and I'm hoping that I didn't knock out all that air from that white chocolate mousse because one of us will be going home today and I don't want to be me.


[User] Please transcribe this text

[Assistant] I think I'm definitely, um, one step closer after that cook. That cook was the hardest cook I've done so far on this Master Chef journey.


[User] Please transcribe this text

[Assistant] I'm really excited. I've grown a lot regards to how I treat food. I find that I have a lot more respect for ingredients.


[User] Please transcribe this text

[Assistant] And even just my mindset about how I create a dish, cause I can go overboard with my flavor combinations. I like to do crazy things, but I know that that can be my downfall eventually.


[User] Please transcribe this text

[Assistant] I'm feeling the coral and it's really light and fluffy. I'm pretty happy with it and I'm getting that really cool coral shape.


[User] Please transcribe this text

[Assistant] I finished putting up my dish and it looks like a beautiful dessert and I can't believe it. I'm just so, so proud of myself.


[User] Please transcribe this text

[Assistant] I would love to be the youngest contestant that could potentially win MasterChef. So right now, I'm praying that I'm safe.


[User] Please transcribe this text

[Assistant] Yes, I made it to the grand final! I, I can't believe that I could potentially win this thing, but I just cannot wait for tomorrow.


[User] Please transcribe this text

[Assistant] Today, you need to show us more. You can do it.


[User] Please transcribe this text

[Assistant] You need to show us you got what it takes to be in this year's Top 24.


[User] Please transcribe this text

[Assistant] So, who's next? Who cooked the crab?


[User] Please transcribe this text

[Assistant] Well done. It was perfectly cooked crab and that XO was delicious. Well done.


[User] Please transcribe this text

[Assistant] But, one of you is definitely gonna get that last apron.


[User] Please transcribe this text

[Assistant] Another chance. The both of you are cooking again. Right here, right now.


[User] Please transcribe this text

[Assistant] I think Matt hit the nail on the head, chocolate berries cream. How can you go wrong?


[User] Please transcribe this text

[Assistant] Congratulations for not giving up and that's the whole mantra of this kitchen.


[User] Please transcribe this text

[Assistant] What I do love is that praline. It's got bitterness there.


[User] Please transcribe this text

[Assistant] Strap in, it's going to be the best time of your lives. We'll see you tomorrow in the Masked Chef kitchen.


[User] Please transcribe this text

[Assistant] Last chance to get an apron! One hour to go!


[User] Please transcribe this text

[Assistant] We've been talking about symbol codes or variable length codes, and sometimes people also refer to those as source codes. And we saw these nice little examples of symbol codes, and we noticed that our example C here had a serious deficiency in that for a given sequence of


[User] Please transcribe this text

[Assistant] of uh, code words, we were not able to uniquely determine the sequence of source symbols that generated that sequence of code words.


[User] Please transcribe this text

[Assistant] And we refer to this as it being not uniquely decodable.


[User] Please transcribe this text

[Assistant] Now let's see if we can come up with a more mathematical definition or characterization of that property. So we would like to be able to characterize codes that are uniquely decodable in the sense that for any given sequence of


[User] Please transcribe this text

[Assistant] Or another way to say that is that if two sequences of source symbols are different,


[User] Please transcribe this text

[Assistant] And then they generate different sequences of code words. Different sequences, well not just different sequences of code words, but different sequences when you look at the actual, uh, code symbols, the actual sequence of say zeros and ones in this case, that the code words make up. That you can, that they have different sequences. So there is actually a


[User] Please transcribe this text

[Assistant] Nice mathematical concept for just this thing. And so we can define.


[User] Please transcribe this text

[Assistant] Property of C being uniquely decodable.


[User] Please transcribe this text

[Assistant] So we say that C is uniquely decodable if


[User] Please transcribe this text

[Assistant] It's extension c star, let me write that clearly, if c star is one to one. That's it. If it's one to one.


[User] Please transcribe this text

[Assistant] A one-to-one function. So remember C star was this function.


[User] Please transcribe this text

[Assistant] It was a function from x star to a star, a function from sequences of source symbols to sequences of code symbols, determined by stringing together there the code words. And so when we say that c star is one to one,


[User] Please transcribe this text

[Assistant] We mean that for any, you know, for any, so I could say i.e. if x1 up to xn,


[User] Please transcribe this text

[Assistant] Is not equal to y1 up to yn, and these are two sequences of source symbols. Then that implies, or maybe I should say, then, c star,


[User] Please transcribe this text

[Assistant] Or I guess this doesn't have to be, uh, I mean this could be like M or something. Any two sequences are different. Right.


[User] Please transcribe this text

[Assistant] So that is the definition of a uniquely decodable code. And if it's not clear to you immediately that that that this definition gives us the property that you want, you might want to pause and think about that for a second.


[User] Please transcribe this text

[Assistant] So, unique decodability is certainly a property that we are going to want in a symbol code. If we're going to do lossless compression, we need to be able to recover the original sequence of source symbols that we wanted to encode. So, you know, when we're doing lossless compression, we're going to have a sequence of source symbols like, you know,


[User] Please transcribe this text

[Assistant] You know, a, b, d, d, c, whatever, blah, blah, blah. And we're going to send that to some sequence of zeros and ones.


[User] Please transcribe this text

[Assistant] Then we would like to recover, you know, we would like to be able to decode the sequence of zeros and ones to recover our original sequence of source symbols. So we certainly need it to be uniquely decodable in order to be able to recover it, uh, for any, any given sequence.


[User] Please transcribe this text

[Assistant] That said, are there any other properties that we would be desirable? Is that it? You know, just take any uniquely decodable code and then voila, we've got, you know, a great code. Well, not necessarily. Certainly there are, there are going to be other things that would be, we would want to consider. And the first of which is, well, we're talking about doing compression. So other desirable properties would be, let's see, desirable properties.


[User] Please transcribe this text

[Assistant] The first of which would be if we're doing compression, we want to have good compression, right? So we want efficiency in the sense of good compression.


[User] Please transcribe this text

[Assistant] What else? Well, this is going to be some algorithm that we're going to implement. So we want it to be fast, right? We want it to, we want to have good speed in the sense of computational complexity.


[User] Please transcribe this text

[Assistant] Fast computation for both encoding and decoding. And a third property, at least of the ones that sort of come to my mind, that we would like


[User] Please transcribe this text

[Assistant] Is simplicity. We would like it to be simple.


[User] Please transcribe this text

[Assistant] Now, later we'll come back to A, and we will think much harder about, about this property of good compression or efficiency. But for the moment, let's think about B and C, and in particular B.


[User] Please transcribe this text

[Assistant] So first we said we want it to be fast for encoding.


[User] Please transcribe this text

[Assistant] So let's think about, you know, encoding. Well, I mean, for these little symbol codes, encoding is really not much of an issue. I mean, as long as your source alphabet, as long as your, you know, your x here,


[User] Please transcribe this text

[Assistant] Is not too big. I mean, as long as it's finite and it's not too awfully large. I mean, in general, x could be, could be infinite. I should have mentioned that above. Maybe I didn't mention that, but, but, you know, here x could be countably infinite.


[User] Please transcribe this text

[Assistant] So that would make things a little more difficult, but uhm, not necessarily insurmountable. But as long as x is finite and pretty small, then encoding is going to be a simple task. We just take our sequence of symbols like AACB here.


[User] Please transcribe this text

[Assistant] And for the first one, we just look up in some, we have some lookup table of the sequence, the code word for A, and we just write it down and then we look up the sequence, the code word for the next guy and we write that down and so on. So encoding time,


[User] Please transcribe this text

[Assistant] Generally, it's not going to be a major issue, at least, you know, when you have a small, finite source alphabet. So what about decoding time?


[User] Please transcribe this text

[Assistant] Is there any way that we could characterize codes which are, you know, some simple mathematical characterization of codes which are fast to decode?


[User] Please transcribe this text

[Assistant] Well, maybe to start to get some intuition for this, we can look at these two examples, A and B here. C was not uniquely decodable, so let's just forget about that for now. A and B.


[User] Please transcribe this text

[Assistant] Well, first, are they uniquely decodable? I guess we know we said C was not, but we haven't really determined whether these are or not. So we have A and B here.


[User] Please transcribe this text

[Assistant] And maybe before we just jump to trying to determine whether uniquely decodable and just, let's, let's maybe just play around with trying to decode a sequence from each of these. So let's do that.


[User] Please transcribe this text

[Assistant] Now I have prepared for your convenience a sequence


[User] Please transcribe this text

[Assistant] Drawn from that code?


[User] Please transcribe this text

[Assistant] And, uh, and I copied the code down here so we could use it for reference. So I took, so I generated this by taking some sequence of source symbols, a, b, c, and d, and I wrote down the corresponding code words and strung them together, but I've since forgotten what it is, so we're gonna figure out what the sequence of source symbols was for this. So let's do that. So we start out, we have a zero.


[User] Please transcribe this text

[Assistant] And so we know that there's some sequence of code words that generated this, and the only code word that starts with zero is ca. So we know that the first symbol in the source sequence must have been an a.


[User] Please transcribe this text

[Assistant] Now what do we have? We have a one, so that takes care of this guy. We have a one. So all of these begin with one. It could have been any of those, not this one. And then we have another one and then a zero. So let's see. So it couldn't have been this. It could have, after two, after two ones, it could have been either of these. But then after we see the zero, we see one, one, zero, we know that it had to be C. So this was, this must have come from C. Right, that worked really.


[User] Please transcribe this text

[Assistant] See? Now what do we have? We have zero, one, one, one, blah, blah, blah. So we'll see zero.


[User] Please transcribe this text

[Assistant] Well that has to be A, right? That must have been A. Now we have 1, 1, 1, etc. So it couldn't have been that one.


[User] Please transcribe this text

[Assistant] So 1, 1, 1, let's see, 1, 1 doesn't match with that, 1, 1, 1 doesn't match with that, had to be D, so 1, 1, 1 must have been D. Now we have 1, 0, 1, blah, so let's see, 1,


[User] Please transcribe this text

[Assistant] One, after one, it could have been any of these, but then after one zero, we know it had to be B, so let's see, B. Then one zero again, it couldn't have been A, and then after we see the zero, we know that it had to be B.


[User] Please transcribe this text

[Assistant] We could just sort of, as we travel along the sequence, just, just look at each, uh, symbol in turn and narrow down the possibilities. And then we could just write down, as soon as we saw each code word, we could just write down the corresponding source symbol.


[User] Please transcribe this text

[Assistant] Instructive case for A, and now let's think about, let's think about B.


[User] Please transcribe this text

[Assistant] Let's do a similar example for B. So let's go down here and again for your


[User] Please transcribe this text

[Assistant] Viewing convenience, I have prepared a sequence for B.


[User] Please transcribe this text

[Assistant] And I've copied the code here so we can nice and easily refer to it. So let's start out. Let's just do the same thing. So we start here. We have, let's see, one, one, zero. So it is a one. Let's see. So that's consistent with A or D and we have one, one. So.


[User] Please transcribe this text

[Assistant] Uh, that couldn't have been A, so it must have been, so the first one must have been D. Now let's see, now we have 101.


[User] Please transcribe this text

[Assistant] And let's see, it couldn't have been those, uh, the first symbol, it could have been consistent, so we're just looking at 1, we could have had D, so let's see, so let's back up. So 1 could be consistent with A or D, 1, 0 could be consistent with A,


[User] Please transcribe this text

[Assistant] Or it could be DB or DC, but now when we look at the third one, let's see, it can't be


[User] Please transcribe this text

[Assistant] It could be A, but it couldn't be DB because then the third symbol would be a zero here. And it couldn't be DC because the third symbol would be a zero. So we know that this must have been A.


[User] Please transcribe this text

[Assistant] Okay, now we have zero. I'll maybe do one symbol at a time. Zero could be, could be B or C.


[User] Please transcribe this text

[Assistant] Then another zero, so zero zero could be, still be our C.


[User] Please transcribe this text

[Assistant] Or it could be bb. Or it could be bc.


[User] Please transcribe this text

[Assistant] So, okay, now we have to look again, so we have 0000, this could be, okay, now C is eliminated, but now we could have either


[User] Please transcribe this text

[Assistant] Okay, so now I have to keep looking, zero, zero, zero, zero, zero. What could this be? This could be BC, or it could be BBB.


[User] Please transcribe this text

[Assistant] But, let's see, could it, it could be BB, it can't be BBB.


[User] Please transcribe this text

[Assistant] But what about bb, no it can't be bba, it can't be bbd. So therefore, so it must have been, finally we see that this, this must have been b, and this must have been c. Okay.


[User] Please transcribe this text

[Assistant] That was some, some logic there. And now we have the last little piece. And what is this? Well, let's see. We have a zero. So that could be B or C. We have zero, zero. That could be B or C still. Zero, zero, one.


[User] Please transcribe this text

[Assistant] That could not be C, so it must have been B, either A or D, but we know it ends now, so it must have been BD. So this must have been B, and this must have been D.


[User] Please transcribe this text

[Assistant] Alright, so we, we, we got it, we managed to do it, so it was, it was, at least on this little example, this was uniquely decodable, and that doesn't necessarily imply that the whole code is uniquely decodable, but this little example was,


[User] Please transcribe this text

[Assistant] But it took us quite a bit more, at least I think for me, at least going, mentally going through this was quite a bit more difficult than this first one. And, uh, so, you know, at least sort of heuristically on this example, it looks like code B is going to take longer to decode in general than, than A.


[User] Please transcribe this text

[Assistant] So can we describe a little, you know, why, why was A easier than B?


[User] Please transcribe this text

[Assistant] Well, if you think about what was going on here in B, we had to look ahead. You know, even after we had read zero zero, we couldn't determine whether B was the symbol yet. We had to read all the way, four symbols into the future, four symbols ahead, before we could figure out that this had to have been B.


[User] Please transcribe this text

[Assistant] So that was, whereas, whereas with, with A, with our Eglise in this example, we were able to immediately, after, upon reading any given, you know, sequence, like when we got to 110 here, we were able to just immediately say, ah, that must have been C.


[User] Please transcribe this text

[Assistant] So that was a property that, that this code had, at least in this example, and this code did not. And so it turns out I'll, I'll


[User] Please transcribe this text

[Assistant] If I just flew you in, I'll jump to the, jump to the, to the chase and tell you that in fact both of these codes are uniquely decodable. You might have been able to sort of see why for this one. For this one, it's a bit more subtle to see why this is in fact uniquely decodable in general.


[User] Please transcribe this text

[Assistant] But I'll leave that as an exercise for you to prove. That would be a nice little exercise for you to take as a proof. Can you prove that B is in fact a uniquely decodable code? So that's an exercise. Exercise.


[User] Please transcribe this text

[Assistant] And A is also uniquely decodable. And in fact, A is what's called a prefix code. A is a prefix code.


[User] Please transcribe this text

[Assistant] And next, in the next video, we'll define what that means, what a prefix code is, or it's also called prefix-free or instantaneous. And that property is just what we observed as we were decoding this little example, that as soon as we finished reading a given code word,


[User] Please transcribe this text

[Assistant] We were able to immediately decode it. We were able to, upon the completion of reading any given code word, we were able to just instantaneously determine what the, the, the, the, the, the symbol that had generated the sequence up to that point.


[User] Please transcribe this text

[Assistant] Alright, and that's called the prefix property for reasons that will become clear in the definition. Okay, so we'll do that next.


[User] Please transcribe this text

[Assistant] I can't believe the last plates ever to leave the Press Club kitchen are going to be from us.


[User] Please transcribe this text

[Assistant] I'm so nervous, I've been waiting for so long. There's so much riding on this cook.


[User] Please transcribe this text

[Assistant] I'm nervous. I know George's standards. His plating is impeccable. This dessert is going to have to be spectacular. Okay, so I've got a couple of ideas. First thing I get onto is planning my menu. I'm gonna do a burnt honey ice cream.


[User] Please transcribe this text

[Assistant] I'm going to put them in the fridge to rest before I bake them. And now I need to get started on my burnt honey ice cream.


[User] Please transcribe this text

[Assistant] My dish is the last thing that these diners are gonna eat ever at the press club. Nicole!


[User] Please transcribe this text

[Assistant] This is nuts. Not long now Nicole, yeah? I've got to do my candied walnuts. I've got to finish my mousse and take out my oranges. I'm leaving my three main elements to the last minute. My olive oil chocolate mousse, my ice cream, and my kudumbethy biscuits.


[User] Please transcribe this text

[Assistant] I'm gonna finish my honey and olive oil chocolate mousse at the very last minute. Put some honey in that. Because the mousse could split if it sits for too long.


[User] Please transcribe this text

[Assistant] I can't believe the last plates ever to leave the Press Club kitchen are going to be mine.


[User] Please transcribe this text

[Assistant] Finally, it's time to plate up. I get my walnuts on the plate. I get my orange segments. Get my Coote and Bethes dusted with icing sugar.


[User] Please transcribe this text

[Assistant] And finally, the moose is going to be scooped on by the waiters. Service please.


[User] Please transcribe this text

[Assistant] So lovely of George to open up pretty much his home to us. It's been the most amazing experience. We're so lucky.


[User] Please transcribe this text

[Assistant] Asked Wujing. Wukong frowned.


[User] Please transcribe this text

[Assistant] He probably stopped to take a nap. That pig is so lazy. Yes, he's very lazy.


[User] Please transcribe this text

[Assistant] I wanna make sure the Tang Monk is still alive. Then I'll go to Guan Yin myself.


[User] Please transcribe this text

[Assistant] Bajie didn't take a nap after all! I must go to the real Guan Yin right away!


[User] Please transcribe this text

[Assistant] We have a problem, Bodhisattva, said the monkey. The Tang monk was caught by a demon named Red Boy.


[User] Please transcribe this text

[Assistant] The demon makes magic fire that water can't put out! Bajie was on his way here to ask for your help. But the demon made himself look like you and tricked the pig!


[User] Please transcribe this text

[Assistant] He called. I don't understand. It's just a small base, but I can't lift it.


[User] Please transcribe this text

[Assistant] Epic. The first major challenge. Cook something for us as if we were coming round to your house.


[User] Please transcribe this text

[Assistant] The 24 of you are standing here today because you're great home cooks and probably the best time in your own home kitchens is that time when you get to cook for friends or for family, for who you invite over maybe for a special occasion. That's some of the most rewarding meals that you can cook ever.


[User] Please transcribe this text

[Assistant] And today, what we want you to do is cook something for us as if we were coming round to your house for a dinner party.


[User] Please transcribe this text

[Assistant] You can cook anything that you want. Sweet or savory. A single plate or shared style. But what it's gotta do is it's gotta wow us. It's gotta represent you as a cook.


[User] Please transcribe this text

[Assistant] An open pantry and the garden is in place. So you've got loads of opportunity to bring us something that is delicious. We're going to taste every dish.


[User] Please transcribe this text

[Assistant] And the contestants that cook the three least impressive dishes will go into tomorrow's elimination.


[User] Please transcribe this text

[Assistant] You don't wanna be there, you know that. So cook something delicious and


[User] Please transcribe this text

[Assistant] Good luck from all three of us. Your time starts now!


[User] Please transcribe this text

[Assistant] So share with me the secrets of your father and his true love.


[User] Please transcribe this text

[Assistant] Well, you need to think of how you can add depth in terms of flavour. What can you do in terms of spices, in terms of things you can fry and pass over? And in this kitchen?


[User] Please transcribe this text

[Assistant] This is a great example of the sort of good home cooking that belongs in great restaurants.


[User] Please transcribe this text

[Assistant] And I love the fact that when I came round he said, the prawns are going to be hard, they're going to be overcooked, they need to be for this dish. And when you try that, that's exactly what you get.


[User] Please transcribe this text

[Assistant] The delicate silkiness of that custard, the beautifully cooked fish, all goes beautifully together.


[User] Please transcribe this text

[Assistant] Big bowl of rice, that piled on top. Well we're gonna be happy, we're not gonna complain. Next up...


[User] Please transcribe this text

[Assistant] There's certain food that inspires a low guttural moaning when you eat it. You know, that kind of grunting of pleasure. For me, that dal just has that.


[User] Please transcribe this text

[Assistant] And this curry tastes so different to any of the other curries we've seen in the 10 years of MasterChef and it's exciting.


[User] Please transcribe this text

[Assistant] Oh, Brett looks like those tacos had a change of tack.


[User] Please transcribe this text

[Assistant] The chicken, the spicing is quite flat. Then you need some, a salad, I need some, I need some, I really need some lime juice.


[User] Please transcribe this text

[Assistant] Today wasn't supposed to be about the top dishes, but we really have to give some of you a special shout out.


[User] Please transcribe this text

[Assistant] Chloe, you bought us probably the biggest surprise of the day. Two delicious versions of Garman classics. Thank you.


[User] Please transcribe this text

[Assistant] And finally, over the ten seasons of MasterChef, aspiring home cooks have tried to take the drizzle cake and turn it into a spectacular dessert.


[User] Please transcribe this text

[Assistant] No one has done it as well as you did today, Gina. That was so beautiful, so delicious, so multi-faceted. Well done.


[User] Please transcribe this text

[Assistant] Mice and rats reach the end of their lives after just four years. While for the bowhead whale, Earth's longest-lived mammal, death can come after 200.


[User] Please transcribe this text

[Assistant] Like most living things, the vast majority of animals gradually degenerate after reaching sexual maturity in the process known as aging. But what does it really mean to age?


[User] Please transcribe this text

[Assistant] The drivers behind this process are varied and complicated.


[User] Please transcribe this text

[Assistant] But aging is ultimately caused by cell death and dysfunction.


[User] Please transcribe this text

[Assistant] When we're young, we constantly regenerate cells in order to replace dead and dying ones.


[User] Please transcribe this text

[Assistant] But as we age, this process slows down. In addition, older cells don't perform their functions as well as young ones.


[User] Please transcribe this text

[Assistant] That makes our bodies go into a decline, which eventually results in disease and death.


[User] Please transcribe this text

[Assistant] The answer lies in several factors, including environment and body size.


[User] Please transcribe this text

[Assistant] These can place powerful evolutionary pressures on animals to adapt, which in turn makes the aging process different across species.


[User] Please transcribe this text

[Assistant] Perhaps the most impressive of these ocean-dwelling ancients is the Antarctic glass sponge, which can survive over 10,000 years in frigid waters.


[User] Please transcribe this text

[Assistant] In cold environments like these, heartbeats and metabolic rates slow down.


[User] Please transcribe this text

[Assistant] Researchers theorize that this also causes a slowing of the aging process. In this way, the environment shapes longevity.


[User] Please transcribe this text

[Assistant] When it comes to size, it's often, but not always, the case that larger species have a longer lifespan than smaller ones.


[User] Please transcribe this text

[Assistant] For instance, an elephant or whale will live much longer than a mouse, rat, or vole, which in turn have years on flies and worms.


[User] Please transcribe this text

[Assistant] Some small animals like worms and flies are also limited by the mechanics of their cell division.


[User] Please transcribe this text

[Assistant] They're mostly made up of cells that can't divide and be replaced when damaged, so their bodies expire more quickly.


[User] Please transcribe this text

[Assistant] And size is a powerful evolutionary driver in animals.


[User] Please transcribe this text

[Assistant] So it has evolved to grow and reproduce more rapidly like an evolutionary defense mechanism against its shorter lifespan.


[User] Please transcribe this text

[Assistant] Exceptions to the size rule include bats, birds, moles, and turtles. But in each case, these animals have other adaptations that allow them to escape predators.


[User] Please transcribe this text

[Assistant] But there are still cases where animals with similar defining features, like size and habitat, age at completely different rates.


[User] Please transcribe this text

[Assistant] In these cases, genetic differences like how each organism's cells respond to threats often account for the discrepancies in longevity.


[User] Please transcribe this text

[Assistant] So it's the combination of all these factors playing out to differing degrees in different animals that explains the variability we see in the animal kingdom.


[User] Please transcribe this text

[Assistant] Humans currently have an average life expectancy of 71 years, meaning that we're not even close to being the longest living inhabitants on Earth.


[User] Please transcribe this text

[Assistant] But we are very good at increasing our life expectancy.


[User] Please transcribe this text

[Assistant] Since then, we've learned to adapt by managing many of the factors that cause deaths, like environmental exposure and nutrition.


[User] Please transcribe this text

[Assistant] This and other increases in life expectancy make us possibly the only species on Earth to take control over our natural fate.


[User] Please transcribe this text

[Assistant] Walking onto the hallowed turf is just amazing. The grass is perfect. The group is just pumping with energy.


[User] Please transcribe this text

[Assistant] So the package got delivered at the neighbor because I wasn't home to take it in. So I'll go my after filming this video and then through the power of editing.


[User] Please transcribe this text

[Assistant] I just want something that's just not- not- not- will keep the non-fictions and like the hardy classics for when I have a little bit more space.


[User] Please transcribe this text

[Assistant] Let's start with some books that I bought myself. If you've seen my Paris vlog, you know that I, you already know which books I bought in Paris.


[User] Please transcribe this text

[Assistant] The Yellow Wallpaper by Charlotte Perkins Gilman. This is a really short story that's kind of horror-ish. It's kind of based on the author's own life back in the 18th, 19th, 19th century, where she was


[User] Please transcribe this text

[Assistant] Which is obviously not very good for you mentally, and it's kind of weird that women were told to do that, and it is about that experience, but a woman experiencing that slowly descending into madness.


[User] Please transcribe this text

[Assistant] Is Normal People by Sally Rooney. I have actually already read this book, or video actually, and I originally got this contemporary fiction book from the library, but I really enjoyed it, and sometimes when I really enjoy


[User] Please transcribe this text

[Assistant] Okay, anyway, learning new things today. I've been wanting to read Frankenstein for a very long time, and I was totally planning on just buying, you know, like, the edition that fits with my other Penguin classics so that, you know, like, all my classics are kind of...


[User] Please transcribe this text

[Assistant] How beautiful is he? So, yes, I was already planning on reading Frankenstein, hopefully sometime during the fall, and now that I have this beautiful edition of it, I can't wait. I have to read this, I have to read it.


[User] Please transcribe this text

[Assistant] This is already going on that I might read this pile. So I know that I mentioned that I want to try to get into horror. So there's a specific type of horror that's kind of my favorite. I think the correct term for it is like cosmic horror.


[User] Please transcribe this text

[Assistant] I bought his collection of short stories, it's called Songs of a Dead Dreamer and Grim Scribes. Look at the illustration on the cover, that looks like


[User] Please transcribe this text

[Assistant] Uhm, so I just wanted to own this so that maybe on the train, you know, I can just like read one story at a time, maybe before bed, maybe that's not a very good idea.


[User] Please transcribe this text

[Assistant] About Egyptian mythology, I realized that I just don't really know a lot, and it's one of those mythologies that I've always found super interesting, especially when I was younger, I wanted to know.


[User] Please transcribe this text

[Assistant] City-based fantasies, you know, like Six of Crows and The Guild of Wolves, so I'm super excited about this one. I've heard so many great things. Just another series that I'm starting. So these are six books. I'm not gonna read all of these because I also have other books that we need to get through. So let's take a look at which one of these books I plan on reading.


[User] Please transcribe this text

[Assistant] I don't think it's like the most perfect fall book and I'm like, I'm looking for cozy books, dreamy books.


[User] Please transcribe this text

[Assistant] The other book that I 100% wanna give priority is The Package.


[User] Please transcribe this text

[Assistant] This was getting so much hype on TikTok. It's a dark academia based on the library of Alexandria. We follow multiple characters who were kind of chosen to kind of enter this contest.


[User] Please transcribe this text

[Assistant] A book that I wanted to read last year and didn't. I have of course Jane Eyre, the perfect book for fall, the perfect...


[User] Please transcribe this text

[Assistant] On the train, you know, just like how I got through The Idiot by Dostoevsky, I can get through Crime and Punishment. What I did not take into account


[User] Please transcribe this text

[Assistant] A little bit more like attention. I feel like if I put this off again, I'm just never gonna get through it. But I also feel like if I try to read this now, I'm just not really gonna enjoy it as much as I could, because I'm just not like in the right mindset to read this. I don't have to read books. It's okay to put up a book.


[User] Please transcribe this text

[Assistant] And then another book that hurts, as many books on the to be read shelf hurt. We have another book that's been here for about three years, maybe longer. Night film.


[User] Please transcribe this text

[Assistant] The perfect October book. It's perfect for fall, you know. It's scary. It's about cults. There's a murderer. It's multi-media, so there's like...


[User] Please transcribe this text

[Assistant] I've already started this, I'm only on page 50. I'm really enjoying this, and this one I'm definitely.


[User] Please transcribe this text

[Assistant] My to be read list for the upcoming months is I just take a look at like the list that I keep of books that I want to read. So in Notion I always just keep a list of books that sound interesting to me that I might want to read, but I might not own yet. And I think it's a good practice to, you know, while making these kind of videos to think about which books


[User] Please transcribe this text

[Assistant] It asks a lot of its reader and I don't think I can get through that right now.


[User] Please transcribe this text

[Assistant] I wanna read that. This girl who rarely ever reads horror.


[User] Please transcribe this text

[Assistant] For during the autumn time, so I wanna buy like at least like one


[User] Please transcribe this text

[Assistant] Dark academia book that I can sink my teeth into the upcoming months.


[User] Please transcribe this text

[Assistant] And it's gonna be either the Secret History, this is like the OG Dark Academia, of course I have to rate this one, and then I've heard great things about Bunny, which I'm not really sure what it's about, I know that it's Dark Academia about this kind of cultish-like friend group of girls.


[User] Please transcribe this text

[Assistant] Is actually Annihilation, like the book that the movie is based on, because I love the movie. And at first I thought, oh, you know, I'm not gonna read the book because I've already seen the movie. But apparently the book is very different from the movie, or even better, so now I am kind of interested in it, so.


[User] Please transcribe this text

[Assistant] Maybe if the mood strikes, I might read Annihilation. I mean, Jeff VanderMeer is like THE person for cosmic existential horror. He even wrote-


[User] Please transcribe this text

[Assistant] I forgot to mention that he wrote the introduction to this short story collection by Thomas Licati, because Jeff VanderMeer is like the current person to go to.


[User] Please transcribe this text

[Assistant] And then here are these classics, Jane Austen and Jane Eyre that I have here. I do want to get through more classics, uhm, but I'm already going to reach Frankenstein and I think two classics is enough especially


[User] Please transcribe this text

[Assistant] If I just wanna keep it a little low key, so I think I'm gonna go for the most autumnal one, and that is Jane Eyre, just gonna...


[User] Please transcribe this text

[Assistant] I just gotta sink my teeth into this one. Then if I feel the need to read like a horror book, I'm probably gonna try to find Tender is the Flesh somewhere, or maybe Annihilation. And then...


[User] Please transcribe this text

[Assistant] Any one of these. And that already brings us to like seven books, which uhm, I don't think I'm gonna be able to read more than that in like two months, maybe if we count November as well. If for some reason I do feel like reading a thriller,


[User] Please transcribe this text

[Assistant] I just have to tell myself to maybe finally read Nightfilm, but I cannot make any promises.


[User] Please transcribe this text

[Assistant] I am very excited about this list. Lots of good reading is gonna happen on the train, and maybe when it starts raining, because to be honest, right now, in the Netherlands, suddenly the weather decided, oh, you know we didn't give you summer for like,


[User] Please transcribe this text

[Assistant] But knowing the Dutch weather, it'll probably completely turn around in a few days and suddenly get super cold and rainy. And for those days...


[User] Please transcribe this text

[Assistant] We got these babies. I hate- why am I calling them- I don't like that I just called these books babies. I don't know why that feels wrong. I don't like that I just said that. We'll have these beautiful books.


[User] Please transcribe this text

[Assistant] I just love a little organizational content. I hope you're going to have a wonderful fall or spring. I hope beautiful stories will be consumed no matter how many or how little. And I also hope you will have a wonderful rest of your day, and I will see you again in another video. Goodbye!


[User] Please transcribe this text

[Assistant] Next we'll take a look at Comparators, which is a Java mechanism that helps us sort the same data on different sort keys in different orders. And you're familiar with this. Your music library, maybe at one point you sort it by the artist's name. In this case we're looking at the bees.


[User] Please transcribe this text

[Assistant] Uh, but in another situation, you might want to sort it by song names to look through it by song names. That's the same data using different sort keys. How do we arrange to do something as natural as this in our Java sorts?


[User] Please transcribe this text

[Assistant] Now, we used before, in order to be able to implement sorts that can sort any type of data, we used Java's Comparable Interface. And the concept is that there's some natural ordering of the data that you'll want to use most of the time. That's what the Comparable Interface is all about.


[User] Please transcribe this text

[Assistant] Uh, but there's a different interface called the comparator interface, which is a way to help us sort using some alternate order or many different orders on the same data.