[User] Please transcribe this text

[Assistant] Uh, and the comparator interface, uh, again, just says that, uh, it's going to implement a method compare that compares two different keys, uh, of a given type, of the generic type. Again, it has to be a total order.


[User] Please transcribe this text

[Assistant] Uh, and this is very familiar, for example, uh, with strings. There's many different ways that we might want to sort strings. We might want to use the natural alphabetic order, or we might want to make it case insensitive, or maybe there's different languages that have different rules of the ordering.


[User] Please transcribe this text

[Assistant] We're sorting strings, but we're implementing a different ordering, uh, various different orderings on that same data. That's what the comparator interface is for.


[User] Please transcribe this text

[Assistant] The idea is that you create a comparator object and then pass that as a second argument to Java's sort routine. And we can do the same thing for our sorts.


[User] Please transcribe this text

[Assistant] The idea is we want to decouple the definition of the data type from the definition of what it means to compare two items of that type.


[User] Please transcribe this text

[Assistant] Uh, with the natural order, we had to put the definition of compare to within the data type. With comparators, we can do that outside of the data type, even at some later time. Strings were defined as part of the Java system, but we can define our own ordering on strings with a comparator.


[User] Please transcribe this text

[Assistant] So in our sort implementations, we can change them as shown in this example to support comparators. To support comparators in our sort implementations, we'll pass an array of objects instead of an array of comparable, and then as a second argument, pass a comparator.


[User] Please transcribe this text

[Assistant] Then the less method will take that comparator as an argument, and it's the one that actually invokes the method compare of two different keys. This is a straightforward modification to our sorts. And then exchange, of course, rather than doing comparable, has to use object.


[User] Please transcribe this text

[Assistant] So with these straightforward changes, add the comparator as argument to the sort and to less, uh, and make our array to be sorted array of objects. It's easy to convert any of our implementations to support comparators.


[User] Please transcribe this text

[Assistant] To implement a comparator, uh, you can use this code as a model. I won't go through it all in detail.


[User] Please transcribe this text

[Assistant] Just to point out that this implements two different comparators as nested classes. Say for this fictional class student that's got two instance variables, name and section.


[User] Please transcribe this text

[Assistant] And the first one called byName, uh, implements a comparator for students. And when you compare two students byName, it's going to use the string compareTo method.


[User] Please transcribe this text

[Assistant] If you're gonna implement it, uh, compared to students by section, then, uh, it'll return just the difference of the sections, which is minus, if less, zero if equal, and plus if greater.


[User] Please transcribe this text

[Assistant] Uh, in, in this code, uh, is straightforward way to implement comparators that you can use as a model, uh, if you need to be able to sort data on two different keys.


[User] Please transcribe this text

[Assistant] Here's just an example of what happens, uh, if with those implemented comparators for that class student using the Java system sort. If you call arrays.sort.


[User] Please transcribe this text

[Assistant] Uh, with your array of students and you give it the s- by name comparator, it'll put them in order, uh, alphabetical order by the name field.


[User] Please transcribe this text

[Assistant] And if you give it the bisection comparator, it'll put them in order by the second field. Very convenient for all kinds of data processing applications.


[User] Please transcribe this text

[Assistant] And we came up with that before when we were talking about using a sort for the Gram scan. We needed to have a comparison for points that, uh, orders them by the polar angle they may make with a given point P.


[User] Please transcribe this text

[Assistant] Uh, that's what we needed for the gram scan algorithm for the convex hull. Uh, points are defined data type for geometric objects, uh, and so what we need is code that'll compute the polar angle, uh, and use that as the basis for comparison.


[User] Please transcribe this text

[Assistant] Uh, but otherwise usually it's a CCW call in this code, which again I won't go through in detail, is an implementation of a comparator for 2D points. It implements the compare method that takes two points as argument, and with just a little bit of calculation it's able to do the compare.


[User] Please transcribe this text

[Assistant] So this code is the basis for applying, uh, the sort, system sort method or any sort method, uh, for the Gram scan for the complex hull that we did at the end of the last lecture.


[User] Please transcribe this text

[Assistant] So that's the basis for the Graham scan method for the complex hull that we used at the last, at the end of the last lecture.


[User] Please transcribe this text

[Assistant] Nothing makes sense. Nothing goes together. I call your name. You're in the bottom three.


[User] Please transcribe this text

[Assistant] And you really want to be one of those five because you remember the best dish takes its maker straight into the immunity challenge.


[User] Please transcribe this text

[Assistant] Be careful with your seasoning, yeaah. You gotta balance the seasoning of everything. Have a play with that, Gina. Good luck.


[User] Please transcribe this text

[Assistant] It's all about the broth. That, that, that's, that's the heart of this dish. The depth of flavor you've got in the broth with limited ingredients is fantastic. And the seasoning across the dish, because you've been shy with your seasoning in the meatballs and I think


[User] Please transcribe this text

[Assistant] I love the colour of the syrup underneath. Combine that with those pickles. It looks nicely balanced between sweet and sour and crunchy.


[User] Please transcribe this text

[Assistant] We've all had a lovely combination of chicken and something sticky, whether in a Korean restaurant or whether it's a sweet and sour.


[User] Please transcribe this text

[Assistant] Oh man. Thanks. Next dish we couldn't resist tasting was Denise's.


[User] Please transcribe this text

[Assistant] The chicken is almost comfy soft, it falls off the bone. The pasta puree is so smooth and there's a richness from that incredible complex sauce.


[User] Please transcribe this text

[Assistant] And all of your dishes showed creativity, they showed technique, and how good that you're inspired by the prospect of the reward of going straight into the immunity challenge.


[User] Please transcribe this text

[Assistant] You know, the three of us love nothing better than a dish that's, that's perfectly cooked. There's one other thing we also love. We love being surprised.


[User] Please transcribe this text

[Assistant] We love those dishes that are like, I don't know, like pasta parcel. Who knows what's in the middle, like a jack in the box. Cut in as a culinary surprise that jumps out at us.


[User] Please transcribe this text

[Assistant] Think of a delicious stuffing inside a rolled chicken breast.


[User] Please transcribe this text

[Assistant] We want something that's going to give us that deliciousness, but also that ooh-ahh moment.


[User] Please transcribe this text

[Assistant] That sauce, not bad. Just need more flavour, you need to really amp up the flavour. Okay.


[User] Please transcribe this text

[Assistant] Rhys. I'm assuming this is a... Cappuccino.


[User] Please transcribe this text

[Assistant] Nothing goes together. None of the flavors are clean. It isn't very well cooked. Oh matter.


[User] Please transcribe this text

[Assistant] There were some not so good surprises today. We think that some of you muddled your ambitions with your abilities.


[User] Please transcribe this text

[Assistant] If I call your name, please step forward, you're in the bottom three, and you'll be competing in tomorrow's pressure test.


[User] Please transcribe this text

[Assistant] When it comes to third place, there are a few contenders.


[User] Please transcribe this text

[Assistant] We were looking for invention, it's an invention test, we always are. We were also looking for those twin elements of surprise, and also, as always, deliciousness.


[User] Please transcribe this text

[Assistant] In the end, what divided those dishes was some...


[User] Please transcribe this text

[Assistant] We're very close to the top. Some of you also should breathe a large sigh of relief.


[User] Please transcribe this text

[Assistant] Pressure test is a whole different style of challenge. You can redeem yourself there.


[User] Please transcribe this text

[Assistant] Doing a three course menu, that really gives those three the chance to cook what they want and show the judges what they're made of.


[User] Please transcribe this text

[Assistant] Yeah, wow. Wagyu needs to be beautiful and pink, but you can't have it too under or it'll be chewy.


[User] Please transcribe this text

[Assistant] Tess has overcooked her marrow and she's gonna have to start all over again.


[User] Please transcribe this text

[Assistant] The barley has been overcooked in the oven. That's the protein on our dessert plate.


[User] Please transcribe this text

[Assistant] I'm a bit nervous. We know that the flavors are good.


[User] Please transcribe this text

[Assistant] Nigella has selected every ingredient in your box. You wanna see what she chose?


[User] Please transcribe this text

[Assistant] I'm sure I don't need to remind you, you are cooking for Nigella. This is a week you will never forget. 60 minutes to go. Come on.


[User] Please transcribe this text

[Assistant] Yeah. That really is, isn't it? Does anything else matter?


[User] Please transcribe this text

[Assistant] You know what it is? There's a cook that can cook to seriously nourish the soul which is...


[User] Please transcribe this text

[Assistant] It's not something that you can just teach someone out of a book. It's something that's within you and you've got that a naze sensation.


[User] Please transcribe this text

[Assistant] What a way to kick off Nigella week. And you guys should be smiling too. Because right now, you'll be cooking for Nigella again. In this week's invention test.


[User] Please transcribe this text

[Assistant] Snap, crackle, pop. Nigella, what would you cook?


[User] Please transcribe this text

[Assistant] That you've allowed nature to be the snap, crackle and the pop.


[User] Please transcribe this text

[Assistant] Wow. I love that. That's, it's just beautiful.


[User] Please transcribe this text

[Assistant] The next dish we'd like to taste belongs to Adele.


[User] Please transcribe this text

[Assistant] I'm really worried for you because it's, there's problems here. It's just dry, dry plate of food.


[User] Please transcribe this text

[Assistant] Just absolutely wonderful. Sometimes that sort of popping candy can be a bit over the top, but it's good to be over the top in this dish. It's playful and you know, the effects were there. Got it brief. Perfectly.


[User] Please transcribe this text

[Assistant] It's a bit of pill to swallow, but your abilities, we know what they are, they're brilliant, brilliant, brilliant.


[User] Please transcribe this text

[Assistant] I love cooking dishes that showcase a part of me, a part of my heritage, but at the same time allow me to show different technique and I can't wait to showcase that for my jello today. So my passion for ice cream is in the churna and I'm just moving on to my sugar syrup for my handfuls, um, cotton candy.


[User] Please transcribe this text

[Assistant] Once I get a bit of colour on that, I'll pour that on the fill cup to start cooling and then I'll start working with the candy to stretch it slightly.


[User] Please transcribe this text

[Assistant] So far, so good. I'm just waiting for my sugar syrup or my cotton candy.


[User] Please transcribe this text

[Assistant] Once you pull it, it should look like fine strands of hair and taste like fairy floss.


[User] Please transcribe this text

[Assistant] You look really miserable. I am. What happened? My sugar was crystallizing, so yeah, it just... I'm very sorry to disappoint.


[User] Please transcribe this text

[Assistant] To make my halva, I mix milk powder, icing sugar, tahini and pistachios and leave it to set.


[User] Please transcribe this text

[Assistant] But they've stayed together, stayed around that metal cone. They're very good, nice and golden, crunchy. Now it's time to take out the metal cones and I'm holding my breath.


[User] Please transcribe this text

[Assistant] They look so good. I'm really happy I've got all the elements to this Middle Eastern version of a Cornetto.


[User] Please transcribe this text

[Assistant] My ice cream's in the churner. My cones are ready. So now I fill my cones up with the chocolate and then with the halva.


[User] Please transcribe this text

[Assistant] They're looking beautiful. They should give you this really supersonic crunch.


[User] Please transcribe this text

[Assistant] What's inside? So I'm gonna do the nougat, ice cream in the middle and then I'm gonna do a salted caramel and then the chocolate on top. The sound is gonna come from the snap of the chocolate bar when the judges bite into it.


[User] Please transcribe this text

[Assistant] To make the Nougat ice cream, I make an Italian meringue. I make a simple sugar syrup and I pour it into whisked egg whites. I'm rushing to get this in the chiller as I'm a little worried I may not have enough time to set. I'm just hoping I can really pull this off.


[User] Please transcribe this text

[Assistant] I'm ready to finish my chocolate bar. I have my biscuit base, my peanut caramel, my chocolate ready. But I'm unsure at this stage whether the new bar is set. I'm so worried.


[User] Please transcribe this text

[Assistant] When I take the nougat ice cream mold out of the chiller, I realised straight away that


[User] Please transcribe this text

[Assistant] Although my dish doesn't look spectacular.


[User] Please transcribe this text

[Assistant] I made a frozen chocolate bar inspired by Snickers.


[User] Please transcribe this text

[Assistant] In this video, we'll introduce the expected code word length of a symbol code as a measure of how much compression a given code is achieving.


[User] Please transcribe this text

[Assistant] So let's go back in time again. Suppose that you're Samuel Morse back in the 1830s and you're trying to design a code to be used for telegraphs.


[User] Please transcribe this text

[Assistant] And you'd like for your code to be efficient in the sense that for a given message that you would like to convey from, you know, one end of the wire to the other, you would like for the encoded message to be as short as possible.


[User] Please transcribe this text

[Assistant] In other words, you, you wanna get good compression. You wanna compress the, the original message.


[User] Please transcribe this text

[Assistant] So let's say that you've already decided that you're going to use a symbol code so you know you have


[User] Please transcribe this text

[Assistant] You know, you're going to choose some symbol code, some function from, from x to a star. And so x would, in this case would be like the alphanumeric, you know, all the letters a to z and all the numbers, all the numerals 0, 1, 2, 3 up to 9. And this would be, you know, for example, like zeros and ones, you know, zero for off and one for on. Or maybe dots and dashes. You could take dots and dashes too.


[User] Please transcribe this text

[Assistant] So how are you going to measure how good a given code is in terms of its compression?


[User] Please transcribe this text

[Assistant] Well, what we were just saying is you want the encoded message to be as short as possible. But of course you don't know what the messages are going to be ahead of time. You have to design your code for all the messages that are going to be sent.


[User] Please transcribe this text

[Assistant] All that you know is that the messages are going to be in English, or you assume that at least.


[User] Please transcribe this text

[Assistant] So it seems like the best thing to do would be to aim for making the encoded messages short on average.


[User] Please transcribe this text

[Assistant] And this is where the probabilities come into play. So earlier we defined a discrete memory list source, so we're going to introduce a discrete memory list source now.


[User] Please transcribe this text

[Assistant] So let's let x be a random variable, a discrete random variable, with


[User] Please transcribe this text

[Assistant] Probability mass function P. So P is the PMF, and let's say X is taking values in script X here. So in other words,


[User] Please transcribe this text

[Assistant] I.e. x has PMFP, or we could also say the same thing, that the probability that x equals little x equals little p of x. All ways of saying the same thing.


[User] Please transcribe this text

[Assistant] And now consider the discrete memory list source in which we take a sequence of random variables, x1 to xn say, and each of them


[User] Please transcribe this text

[Assistant] Has this PMFP and they're independent and identically distributed.


[User] Please transcribe this text

[Assistant] So now we need to introduce a little bit of notation. Some notation.


[User] Please transcribe this text

[Assistant] So this will just be a little...


[User] Please transcribe this text

[Assistant] So if we have some string, let's say alpha, alpha 1 up to alpha k, say, in, and it's a sequence of symbols from our code alphabet. I'm going to use a for our code alphabet. So a star is all those strings. So if alpha is this string,


[User] Please transcribe this text

[Assistant] And here of course, you know, alpha i is, maybe I should say that, if that where alpha i is in


[User] Please transcribe this text

[Assistant] A is in our code alphabet. Then I'm going to use the following notation, this sort of absolute value looking thing, for the number of code symbols in the string. So that would be k in this case, because there were k, uh, k symbols alpha i,


[User] Please transcribe this text

[Assistant] In our code alphabet in this string. Okay, just a straightforward definition. So maybe just a brief example in case that wasn't.


[User] Please transcribe this text

[Assistant] You know, probably pretty clear. But let's say, you know, maybe alpha is, is 01101, then


[User] Please transcribe this text

[Assistant] This notation would mean


[User] Please transcribe this text

[Assistant] Five. And, you know, in this case, A would be like the set zero and one. But if, you know, A could also be the set, say, you know, so this would be where A was zero and one.


[User] Please transcribe this text

[Assistant] Another example. Alpha could be like, you know, A could be, say, a different set. 0, 1, 2, 3, whatever. Maybe just, maybe just has 3 values. And then this would, maybe we have some other strings. 1, 2, I don't know, 2, 0, 1. Something like that. Maybe another 1. So then, the length of that would of course just be 6. Okay, I think you get the idea.


[User] Please transcribe this text

[Assistant] And another little piece of notation that will be convenient is we're often going to be working with a particular code.


[User] Please transcribe this text

[Assistant] And sometimes we'll use this little l of x. This is my little l.


[User] Please transcribe this text

[Assistant] To denote the length of the code words of that code. Remember that the code words are all the, all the values C of X, all the strings C of X, and so when I put the absolute value looking things here, that gives us the length of that code word, and I'm gonna denote that length by L of X.


[User] Please transcribe this text

[Assistant] So if I, you know, usually I'll be clear about what code L corresponds to. So for example, maybe give you another.


[User] Please transcribe this text

[Assistant] Quick example. So let's say our code is, we just have some simple code. C of A is say zero and C of B is say, uh, I don't know.


[User] Please transcribe this text

[Assistant] One zero and c of little c is one one. Then, what would we have? L of a.


[User] Please transcribe this text

[Assistant] L of A would be the length of this code word, which is 1. L of B would be 2. And L of C would also be 2. Okay. So that's all.


[User] Please transcribe this text

[Assistant] So we have these two little pieces of notation here. Boom, boom.


[User] Please transcribe this text

[Assistant] And now we are ready for the definition of the expected codeword length of a code. The expected...


[User] Please transcribe this text

[Assistant] Code word length, sometimes people just say the expected length.


[User] Please transcribe this text

[Assistant] The expected length of a code, or the expected code, or length of a code, C, or X,


[User] Please transcribe this text

[Assistant] For ScriptX for our, for our source alphabet.


[User] Please transcribe this text

[Assistant] Is, we'll denote it by this, just a capital L.


[User] Please transcribe this text

[Assistant] And it's just the expected value, which is...


[User] Please transcribe this text

[Assistant] L of x, the sum over all the values, little x. L of x, p of x.


[User] Please transcribe this text

[Assistant] So this is just the expected value of, so it's just the expected value of this random variable. If I put a capital X in here, remember, capital X is our random variable here, this is our, just our one discrete random variable, and then we took a sequence that looked like that.


[User] Please transcribe this text

[Assistant] But we can just denote it this way. It's the expected value of this random variable.


[User] Please transcribe this text

[Assistant] And of course here, maybe just to be clear, L of X in this case is


[User] Please transcribe this text

[Assistant] So that is the expected code word length, and this gives us a measure of how much compression we're achieving in a code.


[User] Please transcribe this text

[Assistant] In a symbol code. So shorter expected length of course means that you're getting


[User] Please transcribe this text

[Assistant] You're getting greater compression on average. On average, the length of the code words is smaller. So let's do a couple examples just to...


[User] Please transcribe this text

[Assistant] Let's look at, look at those, we have our running examples of some different.


[User] Please transcribe this text

[Assistant] Codes. Let's see what the expected code word length is for those. So we had our, maybe I'll, maybe, maybe I'll pause and, uh, copy and paste from the, our code from the other ones. Okay. So I'll, I'll pause for a sec. Actually, no, I think I'll just, I'll just rewrite them here. So we had our two codes. Remember we had A, maybe I'll put A here. And A, we have X.


[User] Please transcribe this text

[Assistant] Cause now I'm gonna add the probabilities. So let's put the code word.


[User] Please transcribe this text

[Assistant] X each, uh, each source symbol, its probability, the code word, and the length of that code word. So we'll just make a little table here.


[User] Please transcribe this text

[Assistant] So x, in our little example from before, took these four values, a, b, c, or d, and let's take the same probabilities, one half, one quarter, one eighth, one eighth, and we have the code words, zero, one zero, one one zero, one one one,


[User] Please transcribe this text

[Assistant] And of course the length of these is one, two, three, three. And now let's compute


[User] Please transcribe this text

[Assistant] The expected code word length of this code, or the expected length.


[User] Please transcribe this text

[Assistant] So I'll just plugging into the definition here. We have, you know, one times one half.


[User] Please transcribe this text

[Assistant] Plus two times one quarter plus three times one eighth plus three times one eighth. So we get a half plus a half.


[User] Please transcribe this text

[Assistant] Plus three-eighths, plus three-eighths, and so we get one, uh, six-eighths is three-quarters, so that's 1.75. Alright, so we got, so that's just a little.


[User] Please transcribe this text

[Assistant] Example to compute the expected code word length for that one. Not too shabby, 1.75.


[User] Please transcribe this text

[Assistant] Let's do another one, let's do the, let's do our example B. So here we had, let's take the same probabilities.


[User] Please transcribe this text

[Assistant] We also have a, b, c, c, and d, and we'll take the same probabilities, one half, one quarter, one eighth, one eighth, and now our codes, our code words were one zero one, zero zero,


[User] Please transcribe this text

[Assistant] 0001 and 1. And so of course the lengths are 3, 2, 4, and 1. And what is our expected length? Well, we'll just plug in


[User] Please transcribe this text

[Assistant] The formula again, so we have the sum over all the x's, sum over a, b, c, and d of length times probability. So what do we have? We have


[User] Please transcribe this text

[Assistant] Three times one half plus two times a quarter plus four times one eighth plus one times one eighth. So what's this? This is, uh,


[User] Please transcribe this text

[Assistant] Plus one half, plus one eighth. So what do we get?


[User] Please transcribe this text

[Assistant] We have, uh, two, two and a half, two and one-eighth. So what's, uh, wait, did I do that right? Oh, two, two and a half, two, yeaah. Two and a half plus one-eighth is, uh, what's that? Two point six two five, cause one-eighth is point one two five.


[User] Please transcribe this text

[Assistant] Okay, so that's the expected length for example B, and it's significantly longer than this, almost a whole, almost a whole bit longer on average.


[User] Please transcribe this text

[Assistant] Because the length here, right, you, you, you might measure, you might, uh, give units to this in terms of bits. Because in this case, at least our code alphabet was zeros and ones.


[User] Please transcribe this text

[Assistant] So the, the length of this is about 1.75


[User] Please transcribe this text

[Assistant] Code symbols, and in this case they're, they're bits. So it's about 1.75 bits on average.


[User] Please transcribe this text

[Assistant] So those were just two simple examples to illustrate the expected code word length of a symbol code. And I have a question for you, a little challenge of, you know, not too hard maybe, but maybe a little challenge is can you come up with a code which is better than this one? Better than this, this code A?


[User] Please transcribe this text

[Assistant] And if so, what is it? And if not, why not? So that's a, that's a challenge for you to puzzle over. Okay.


[User] Please transcribe this text

[Assistant] Tim, Chloe and Kristen excel. Oh, holy schmoly. Just fabulous.


[User] Please transcribe this text

[Assistant] While Samira, Meta and Michelle found themselves in elimination. Tonight, it's back to where it all began.


[User] Please transcribe this text

[Assistant] And whose time in the MasterChef kitchen will come to an end? We're going home.


[User] Please transcribe this text

[Assistant] So Mary, you're doing really well. Just chalking instincts.


[User] Please transcribe this text

[Assistant] Previously on MasterChef Australia. The first pressure test.


[User] Please transcribe this text

[Assistant] Next time, a mighty offsite team challenge.


[User] Please transcribe this text

[Assistant] I think you're in trouble. It's a disaster. Which team will kick the ultimate goal? I love that. This'll be a fan favourite. I'm all smiles George. And which one will be headed to elimination? From there.


[User] Please transcribe this text

[Assistant] And it tells you, especially every morning when you wake up and see it beside your bed, that you deserve to be here.


[User] Please transcribe this text

[Assistant] Your ambitiousness must be commended. I mean, that's a lot of work in 45 minutes. Make chool, make a curd, make a mousse. It's not easy and in terms of flavour, there's some lovely flavour there.


[User] Please transcribe this text

[Assistant] Chloe, you ready to find out what you're cooking with? I am, George. Here you go, boys.


[User] Please transcribe this text

[Assistant] On this bench are 50 beautiful ingredients.


[User] Please transcribe this text

[Assistant] Chloe, you can pick any ten.


[User] Please transcribe this text

[Assistant] You also get the regular underbench staples.


[User] Please transcribe this text

[Assistant] Chewy will get the same ingredients, so play to your strengths. Right Chloe, come forward and have a look.


[User] Please transcribe this text

[Assistant] Great. Well, what a good start. Great start. Shall we score?


[User] Please transcribe this text

[Assistant] You know, travel to a restaurant to order that and eat it and as a foodie, you know, be like, wow, that's awesome.


[User] Please transcribe this text

[Assistant] And I scored the dish. Nine out of ten.


[User] Please transcribe this text

[Assistant] So I've got my lemon curd, it's in the fridge, uhm, and I've got my twill in the oven, now working on my raspberry mousse.


[User] Please transcribe this text

[Assistant] We don't have to decide now, said Toad. Lunch is ready.


[User] Please transcribe this text

[Assistant] Watching a professional chef like Chewie operate in the kitchen, his knife work is just fantastic. The way he butterflied prawns was just technique, technique, technique. It's clean, it's beautiful to watch.


[User] Please transcribe this text

[Assistant] Today's pressure test has been set by Nigella herself, and it is a doozy.


[User] Please transcribe this text

[Assistant] Today you're going to be cooking some of Nigella's favourite chocolate dishes. One, two, three.


[User] Please transcribe this text

[Assistant] This is the first new type of chocolate to come for 82 years. It has a fruity, berry-like flavor, but there are no berries in it, there's no coloring in it. The color and the flavor are all down to the beans themselves.


[User] Please transcribe this text

[Assistant] And today is a very special day because although Ruby Chocolates had lots of coverage in the press, only a handful of the top chocolatiers have actually got to cook with it.


[User] Please transcribe this text

[Assistant] You are going to join that very small, but very illustrious group.


[User] Please transcribe this text

[Assistant] Listen up, you are running out of time. Fifteen minutes to go. Come on guys!


[User] Please transcribe this text

[Assistant] How did you feel in that last moment when you literally three seconds ago you're pulling out the cookie dough pot and putting it on the plate?


[User] Please transcribe this text

[Assistant] From all that mayhem, I think Adele's done a really good job.


[User] Please transcribe this text

[Assistant] The disaster is the cookie dough. Because there is no chocolate in there.


[User] Please transcribe this text

[Assistant] What we need to do is measure all those dishes against Nigella's original dishes. Let's get them in.


[User] Please transcribe this text

[Assistant] Remember what's at stake here. Bring us your most delicious version of pancakes. With the odds stacked against them.


[User] Please transcribe this text

[Assistant] Which dish would you rather order again?


[User] Please transcribe this text

[Assistant] Ooh, it's closer than you think. It is a lot closer than you think. Let's do it.


[User] Please transcribe this text

[Assistant] Now that we've seen loads of examples of applications of information theory and coding, let's start to think a little bit more abstractly about the problem.


[User] Please transcribe this text

[Assistant] So we started off by saying that we wanted to be able to reliably and efficiently transmit messages from a source to a destination.


[User] Please transcribe this text

[Assistant] So let's draw a little picture to depict this situation. So we're going to have some source over here. And this source is emitting messages from some set.


[User] Please transcribe this text

[Assistant] Usually we aren't going to have a whole lot of control over the source.


[User] Please transcribe this text

[Assistant] I'll make this a nice color coded diagram. So these messages then are going to go to an encoder and we can design the encoder.


[User] Please transcribe this text

[Assistant] The encoder then is going to transform those messages and send them to a channel. So maybe we'll make this nice pink color here.


[User] Please transcribe this text

[Assistant] Channel. And the channel may be noisy. Typically it's going to be a noisy channel. So we'll draw a sort of, sort of noisy box here. It's our noisy channel.


[User] Please transcribe this text

[Assistant] Corresponding to the encoder, we will have a decoder. A corresponding decoder.


[User] Please transcribe this text

[Assistant] So the, the channel's gonna take the encoded messages, and it's probably gonna mess them up in some way. It's gonna do something bad to them. And then the decoder is going to take the output of the channel, and then try to transform it back into the thing that we originally started out with.


[User] Please transcribe this text

[Assistant] And give it to the destination.


[User] Please transcribe this text

[Assistant] So the goal, you know, the source is emitting these messages from some set, and we would like ideally to reproduce the identical messages at the destination.


[User] Please transcribe this text

[Assistant] But the difficulty is that this channel has, uh, is introducing some noise and we may be limited to only sending messages at a certain rate.


[User] Please transcribe this text

[Assistant] So the efficiency comes in, in that we want to transmit as few bits as possible. Sometimes it's as few bits per time unit as possible.


[User] Please transcribe this text

[Assistant] And we also want to ensure that the channel doesn't mess things up so badly that we can't reproduce the original message with a high fidelity, with a high probability of not having an error.


[User] Please transcribe this text

[Assistant] So this is the, this is the problem. This is the general problem. And here, note that


[User] Please transcribe this text

[Assistant] I have sort of coupled the two problems of efficiency and reliability into this combined encoder and combined decoder. So we have both compression and error correction.


[User] Please transcribe this text

[Assistant] Error correction are combined in these two boxes here.


[User] Please transcribe this text

[Assistant] So this is compression and error correction combined.


[User] Please transcribe this text

[Assistant] And of course the compression is the efficiency part and the error correction is the reliability part. Or using our terminology, we might say that this is the source coding part and this is the channel coding part. Now,


[User] Please transcribe this text

[Assistant] To make the rules of the game clear, the standard assumption that is made in this setting, in this information theory and coding, uh, the sort of standard setting, is that we will assume that transmission is only going one way. As you can see, I've only drawn the arrows in this direction.


[User] Please transcribe this text

[Assistant] And it's one way in the sense that the decoder over here can't ask for certain messages, certain parts of the message to be re-sent.


[User] Please transcribe this text

[Assistant] You know, if something gets messed up, the decoder may be able to know that that part of the message was messed up. But he can't go back and say to the encoder, hey, can you send me that little part again? I didn't quite catch that.


[User] Please transcribe this text

[Assistant] So that is not allowed in this standard sort of setup.


[User] Please transcribe this text

[Assistant] And that assumption, uh, a system which operates under that assumption, is said to be doing forward error correction.


[User] Please transcribe this text

[Assistant] And this is opposed to, uh, say, you know, a lot of internet applications, uh, will use something called automatic repeat request or ARQ where the decoder can actually ask for certain parts of the message to be re-sent.


[User] Please transcribe this text

[Assistant] And that can, that can, as you could imagine, that can make a significant improvement in the accuracy of your, the reliability of your transmissions.


[User] Please transcribe this text

[Assistant] However, the sort of, that sort of situation is not applicable in a lot of, a lot of settings.


[User] Please transcribe this text

[Assistant] Because, you know, for example, if you're sending a live transmission of uhm, you know, if you're doing like a video teleconference, or if you're talking on the phone to someone, or if you're transmitting a broadcast of live television,


[User] Please transcribe this text

[Assistant] Then it's, it's, the messages are of a very time sensitive nature and you can't wait for a few, you know, even half a second or quarter of a second to, to, to fix the message because by that time, you know, things have moved on.


[User] Please transcribe this text

[Assistant] So this is the forward error correction situation. And that's the setting that we will be dealing with.


[User] Please transcribe this text

[Assistant] Now, we said, you know, when I wrote down the outline, we decomposed things into the compression part and the error correction part, the source coding part and the channel coding part.


[User] Please transcribe this text

[Assistant] And there is a fabulous little theorem, originally proved by Shannon actually, that says that in fact, this combined problem, we wrote down a sort of combined problem here, this combined problem decouples into the compression problem and the error correction problem. So in other words, we can rewrite the problem here, let's just


[User] Please transcribe this text

[Assistant] Rewrite this whole thing. We can do the following. We can do


[User] Please transcribe this text

[Assistant] Or maybe I'll say source coding, source, and let's say source encoder. This will be our source encoder. And that goes to, maybe we'll make it a slightly greenish color. Then we have a channel encoder.


[User] Please transcribe this text

[Assistant] So the source encoder is handling the sort of compression.


[User] Please transcribe this text

[Assistant] The channel encoder is handling the error correction coding. And as usual, then this goes to our, this goes to our noisy channel. Channel. Can't write that small. Noisy channel.


[User] Please transcribe this text

[Assistant] Of course, goes to the corresponding channel decoder. Channel decoder.


[User] Please transcribe this text

[Assistant] The output of the channel decoder goes to, of course, the source decoder. So over here we have the source, source decoder.


[User] Please transcribe this text

[Assistant] The output of the source decoder goes to the destination. Destination.


[User] Please transcribe this text

[Assistant] So in other words, in order to get optimal performance,


[User] Please transcribe this text

[Assistant] You can design your source encoder to do your compression encoding as best as you can. And then separately, without knowing the details of the source encoder, design your channel encoder to do the error correction coding.


[User] Please transcribe this text

[Assistant] And of course, you're simultaneously defining or designing the decoder for each of those.


[User] Please transcribe this text

[Assistant] And you can do each of those design, design each of those components completely independently of one another. Not knowing one, you know, what's going on in the other one.


[User] Please transcribe this text

[Assistant] And you can do just as well with a system like that as if you had defined, as if you had designed a combined


[User] Please transcribe this text

[Assistant] Uh, compression and error correction, a combined source and channel encoder and decoder system.


[User] Please transcribe this text

[Assistant] So in other words, so the problem decouples in this very nice way. So this is a very, very tidy result.


[User] Please transcribe this text

[Assistant] And this holds under very sort of general, well, fairly general, uh, assumptions on the source, the nature of the source.


[User] Please transcribe this text

[Assistant] So this is, this result is called, this has a nice name of course, and it's the name of this video. It's the Source Channel Separation Theorem. Separation Theorem.


[User] Please transcribe this text

[Assistant] A little bit more specifically, maybe we'll get more precise, more mathematically precise about all this stuff later on.


[User] Please transcribe this text

[Assistant] But a little bit more precisely, this holds, this theorem holds for any source that satisfies the asymptotic equipartition property. And of course I haven't defined what the heck that is, but if you happen to know what that is, then the source channel separation holds, separation theorem holds for any such source.


[User] Please transcribe this text

[Assistant] You can do just as well with a, with a, with a separately designed source encoder and decoder, separately designed from your channel encoder and channel decoder and do just as well as if you had designed them together.


[User] Please transcribe this text

[Assistant] And so of course, I think you're probably getting familiar with this by now, but just to make it clear, this is the


[User] Please transcribe this text

[Assistant] Compression part, I could have written compression in this box, and of course this would be decompression. Decompression. Then here, in the channel encoder, we're doing our error correction coding, and then over here we're doing our


[User] Please transcribe this text

[Assistant] Or our error correction, maybe it's, you know, our error correction decoding or something, whatever you want to call it.


[User] Please transcribe this text

[Assistant] So that's what each of these two things is doing. Now, one thing I should make clear is that this theorem is


[User] Please transcribe this text

[Assistant] It doesn't say anything about how much computation time it requires, the computational complexity of the system that you would have to design to get an equivalent, a system of equivalent performance. In other words,


[User] Please transcribe this text

[Assistant] It might be possible that by, by designing a combined source and channel encoder and decoder system, that you could do just, you could do, have, uh, equivalent performance, but at lower computational complexity than if you had, uh, had separately designed ones.


[User] Please transcribe this text

[Assistant] Okay, so that's the source channel separation theorem, and it's very nice because it allows us to focus on compression without worrying about error correction, and it allows us to focus on error correction without worrying about compression. And that, that makes, that sort of clears the air in a nice way.


[User] Please transcribe this text

[Assistant] Okay, so next we're going to take a look at some examples to, to make it even more clear. You're probably starting to get familiar, but even more clear in your mind about what exactly some examples of, of what this means in the sort of more real life examples that we talked about. So we'll look at that next.


[User] Please transcribe this text

[Assistant] Today I'm making aniseed pancakes with a blueberry compote.


[User] Please transcribe this text

[Assistant] I cook my pancakes in a dry pan so that I can get a beautiful colour on either side. They're done. Take them off and leave them to cool down.


[User] Please transcribe this text

[Assistant] I can't even believe that everyone's around my bench.


[User] Please transcribe this text

[Assistant] It's a big risk to try my hand pulled cotton candy again.


[User] Please transcribe this text

[Assistant] But it's a risk that I'm willing to take because it's immunity up for grabs.


[User] Please transcribe this text

[Assistant] It failed in the mystery box. I've got everything crossed that it's not gonna fail with me now.


[User] Please transcribe this text

[Assistant] Once it's cooled down slightly, I'm able to then roll it, turn it into a ring, and put it in the flour mixture.


[User] Please transcribe this text

[Assistant] In the flour, I start to tease out the circle to make it bigger. And when I get it to the right size, I then can do a figure eight, fold it, and keep doing that, while still incorporating the flour into the toffee.


[User] Please transcribe this text

[Assistant] I'm happy with the way my cotton candy turned out I'm hoping that I haven't been too heavy handed with the cotton candy.


[User] Please transcribe this text

[Assistant] It could be a bit overpowering and a little bit too sweet.


[User] Please transcribe this text

[Assistant] I've made an aniseed pancake with blueberry sauce and my hand pulled cotton candy.


[User] Please transcribe this text

[Assistant] Unanimously, we all chose Chloe. She knows her food, she knows her way around the kitchen, so hopefully she will lead us to victory.


[User] Please transcribe this text

[Assistant] I can't believe it, it seems like only seconds we've walked through those doors and now we have to prep and cook a three course dinner for 50 diners. Fish.


[User] Please transcribe this text

[Assistant] The pressure's on at the moment. Gordon wants the test dish up. My pasta's ready, but we have to wait till the prawn mousse is done and also the bisque is ready.


[User] Please transcribe this text

[Assistant] Gordon's just tasted the test dish for the entree. It's a disaster. It did not work on the plate. The prawn mousse is not right. The bisque is not right. I've made the pasta. It's ready to go. But we still have to roll and fill 50 tortellini.


[User] Please transcribe this text

[Assistant] I can't roll unless that's done. Yeah. The diners will be coming through those doors and sitting down very soon and we still haven't started to roll or fill these 50 tortellini. Gina? Yes? Have you got your filling? Nope, it's not ready yet.


[User] Please transcribe this text

[Assistant] We ditch the first entree, we're making spaghetti with a light chilli and garlic olive oil with a grilled prawn.


[User] Please transcribe this text

[Assistant] It's not the dish that we all agreed on to begin with, but it's looking good on the plate, it tastes good, so I'm really happy with the end result.


[User] Please transcribe this text

[Assistant] Today was so difficult because we didn't work well together as a whole.


[User] Please transcribe this text

[Assistant] On the other hand, I thought our dishes tasted and looked good. So we don't know which way it's gonna go.


[User] Please transcribe this text

[Assistant] It's quite humbling hearing Gary commend that pasta dish. It made me very, very happy to think that at least that kind of pushed us up to maybe an even playing field.


[User] Please transcribe this text

[Assistant] Now we're going to take a look at what happens when we have significant numbers of duplicate keys, which is not at all unusual in practical applications.


[User] Please transcribe this text

[Assistant] And there's plenty of other examples like that in data processing where we find maybe, uh, remove duplicates from a mailing list.


[User] Please transcribe this text

[Assistant] Uh, or all the job applicants, uh, that we get, we might want to sort them by the college attended. So the sort, there's, uh, huge files with huge numbers of duplicate keys. So our sort, it's worthwhile to take a careful look at what the implication of that is.


[User] Please transcribe this text

[Assistant] So again, typical characteristics, we have a huge file, but small number of different key values.


[User] Please transcribe this text

[Assistant] So, let's look at, uh, our algorithms, uh, in that situation. So merge sort, uh, it doesn't matter that much, uh, what the key values are like. Actually, we can show that merge sort always uses between when half n log n and n log n compares.


[User] Please transcribe this text

[Assistant] And, and that's the standard quick sort that was in all the textbooks, uh, almost all the textbooks. Uh, if you did not stop the partitioning on equal keys, uh, it would run in quadratic time. Uh, so we want to do, uh, better than this.


[User] Please transcribe this text

[Assistant] So, the mistake happens if we put all the items equal to the partitioning item on one side, which is a natural way to implement it.


[User] Please transcribe this text

[Assistant] Uh, and the consequence is, if you have all the keys equal, then partitioning doesn't really do anything. Uh, it just, uh, peels off, uh, one key, uh, to do a file of size n, then you get a sub file of size n minus one, and then n minus two, and so forth, and the result is a quadratic time algorithm.


[User] Please transcribe this text

[Assistant] Our implementation, we stop the partitioning scans on items equal to the partitioning item. And then in that case, when all the keys are equal, it's going to divide it exactly in the middle. And then in that case, you get n log n compares.


[User] Please transcribe this text

[Assistant] Uh, but actually, uh, when you think about it, why don't we just put all the items equal to the partitioning item in place? That, that's really a desirable way to look at it, uh, and let's take a look at that option.


[User] Please transcribe this text

[Assistant] So what we want to do is get the array into three parts.


[User] Please transcribe this text

[Assistant] So then now we have two pointers into the middle. One that, uh, is the boundary between the keys that are less than the partitioning element and those that are equal to the partitioning element. Another one that's the boundary between the keys that are equal to the partitioning elements and the one that's greater. And then in the middle are all the equal keys. Now that's what we'd like to arrange.


[User] Please transcribe this text

[Assistant] Uh, now until the 1990s, conventional wisdom among people implementing systems was that it wasn't worth doing this.


[User] Please transcribe this text

[Assistant] Edgar Dykstra had proposed in the 70s as an example of a programming problem. He was really interested in analyzing correctness of programs and showing how you could convince yourself that this program was operating as expected.


[User] Please transcribe this text

[Assistant] Uh, but in the 1990s, uh, we figured out that, uh, really this was going to be an effective way, uh, to sort. Uh, and this was taking a look at the Q sort that, uh, a user found, uh, was broken.


[User] Please transcribe this text

[Assistant] So let's take a look at how it works with the demo. It's more complicated than standard quick sort partitioning. A bit more complicated because there's more to do.


[User] Please transcribe this text

[Assistant] Uh, so now, uh, we have our eye pointer, which is right to the left of stuff we haven't seen yet.


[User] Please transcribe this text

[Assistant] And then we have two other pointers that maintain, maintain these boundaries. Everything to the right of GT is known to be greater than the partitioning element. Everything to the left of LT is known to be less, and between LT and I is known to be equal.


[User] Please transcribe this text

[Assistant] Uh, so we, uh, increment i, uh, and then figure out what to do. So now, uh, it's, uh, less than the partitioning element.


[User] Please transcribe this text

[Assistant] So, uh, what we want to do is, uh, increment LT. So now we have one that's definitely less than the, uh, partitioning element, and LT is, is pointing at the partitioning element.


[User] Please transcribe this text

[Assistant] Uh, and so now, uh, you increment both LT and I, so that's the first case there.


[User] Please transcribe this text

[Assistant] So now we have a second item, B, that's less than the partitioning element, so we exchange it with LT and increment them both.


[User] Please transcribe this text

[Assistant] So we're moving the smaller ones than the partitioning element to the left of LT and keeping LT pointing on the partitioning element.


[User] Please transcribe this text

[Assistant] So in that case, we exchange greater, uh, the one over the right with i and decrement gt. So now we have one over the right that we know is greater than the partitioning element. Uh, notice that we didn't increment i because that element z that was over in the right really hasn't been compared with the partitioning element yet.


[User] Please transcribe this text

[Assistant] But we did decrement GT, so we made progress. So now, uh, what happens here? Now I is pointing to a bigger one, uh, so we're going to, uh, exchange it with the one at GT and decrement GT again.


[User] Please transcribe this text

[Assistant] Uh, and again, y is bigger, so exchange it and decrement gt. Now we have the c, that one's smaller, so that's the first case. So, uh, we'll, uh, move it to the left of lt and increment both lt and i. w is a bigger one, that has to go over to the right.


[User] Please transcribe this text

[Assistant] Now we have, uh, eye pointing to an element that's equal to the partitioning element. And what are we supposed to do then? Well, to maintain the invariant there, we just need to increment eye.


[User] Please transcribe this text

[Assistant] And again, it's pointing at one that's equal to a partitioning element, increment i.


[User] Please transcribe this text

[Assistant] So we exchange that with GT and decrement GT and I's pointing to the one that was there and that one's smaller. So we, uh, exchange it with LT and increment both I and LT and now we're at a point where the pointers have crossed, uh, I and GT have crossed. There's nothing that we haven't examined yet. Uh, so our partitioning is complete.


[User] Please transcribe this text

[Assistant] The implementation is amazingly simple. The whole partitioning process for three-way partitioning in the modern programming language like Java simply maintains the invariance as described in the demo.


[User] Please transcribe this text

[Assistant] Uh, if we find one that's less, uh, we, uh, exchange i and lt and increment them both. If it's greater, we exchange i and gt and decrement that, otherwise we increment i.


[User] Please transcribe this text

[Assistant] In fact, there's an argument for just using this implementation of quicksort and forgetting about whores because it performs so well in so many practical situations.


[User] Please transcribe this text

[Assistant] Uh, and again, uh, when there's lots of equal keys, uh, then there's gonna be a place where one of those is chosen as a partitioning element. And then a big chunk of the array gets handled, uh, just in the partitioning process.


[User] Please transcribe this text

[Assistant] Uh, and one thing to do is to realize that the lower bound that we talked about before, uh, depended on the keys being distinct. It's the worst case for a lower bound is when the keys are all distinct. But if we have a situation where there are lots of equal keys, that model is wrong.


[User] Please transcribe this text

[Assistant] It's not too difficult to get a similar lower bound for the model when, uh, we know that there are some, uh, equal keys. So, for example, this is a rather complicated formula, but not too bad.


[User] Please transcribe this text

[Assistant] And it says that if you know that the i-th key occurs x i times, you can write down a lower bound for the number of compares that are going to be required in the worst case.


[User] Please transcribe this text

[Assistant] And what's interesting about three-way partitioning is that the number of compares that it uses is equal to this lower bound within a constant factor.


[User] Please transcribe this text

[Assistant] So that's entropy optimal. What that means is whatever the distribution of equal keys in there, this thing is going to use a number of compares that's proportional to the best that you could possibly do.


[User] Please transcribe this text

[Assistant] Uh, then there's a lot of applications where your sort routine is going to be linear, not, uh, n log n. So it'll be much faster, uh, than merge sort in, in other methods, uh, for really a broad class of applications.


[User] Please transcribe this text

[Assistant] So taking a look at equal keys, uh, is carefully is something that can lead us to, uh, very efficient quick sort implementations.


[User] Please transcribe this text

[Assistant] I have been assigned to do dessert with Kristen. So today we're going to make vanilla panna cotta with honeycomb and roasted figs.


[User] Please transcribe this text

[Assistant] I gotta make sure that they're gonna be ready and set in time. Otherwise God will be much more sad, and I'm sad than Ella.


[User] Please transcribe this text

[Assistant] The panna cotta is nearly finished. It's going in right now. It's gonna set in time. Yes, it is. Has to. There is no other chance. Panna cotta is ready. I'm happy. Behind. Blast Tila. So, excuse me.


[User] Please transcribe this text

[Assistant] My idea was to not serve such a big amount of panna cotta because the complementing with fresh fruit and anicom was going to be an happy wedding between all the elements. We're not going to serve half a dessert.


[User] Please transcribe this text

[Assistant] So, where is the dessert? It's in the fridge. I know that for him it's not quite set yet. He will need at least five more minutes in the fridge. I want one.


[User] Please transcribe this text

[Assistant] And today's pressure test has been set by someone that we all know extremely well.


[User] Please transcribe this text

[Assistant] And they've graced the menus of Michelin starred restaurants and top hatted restaurants around the world. They require technique, extreme precision.


[User] Please transcribe this text

[Assistant] But most of all, they need to have the lightness of touch for which he is famous. Please welcome, from Burch and Purchase, Darren Purchase!


[User] Please transcribe this text

[Assistant] Darren, fantastic to have you back in the kitchen. This dish has a really long history in the culinary world. It has its own master chef history, but it has a very personal history for you.


[User] Please transcribe this text

[Assistant] Bet you're bursting to see what the classic dessert is under that cloche. Just a word of warning, it's not that classic, and it ain't that simple.


[User] Please transcribe this text

[Assistant] Great color on the biscuit. Will it be crispy enough? That's the big question.


[User] Please transcribe this text

[Assistant] If that was the element that sent you home, what would you do? What would be the next step for you?


[User] Please transcribe this text

[Assistant] I think we probably all agree on who's going home, so let's get them in and give them the good news and sadly the bad news.


[User] Please transcribe this text

[Assistant] Joe, thank you so much for being such a pleasure to have in the competition and I think the thing we'll remember you for is probably one of those joyous moments of season 10 so far.


[User] Please transcribe this text

[Assistant] We loved it when you nailed Matt Arbae's dish in the last pressure test, and you danced with joy.


[User] Please transcribe this text

[Assistant] Brendan, good to see you back. How's the hand? Thank you. Um, yeaah, it's feeling so much better today.


[User] Please transcribe this text

[Assistant] Good spirit, so just gonna fight today. Brand new week, I had a really rough week last week. Endured my hand quite badly. But uhm, it's a new week this week, so I'm excited. Really wanna fight this week, show that I can still cook with one hand maybe.


[User] Please transcribe this text

[Assistant] Standing in front of the mystery box, I'm thinking all the ingredients look awesome. I'm quite excited to just start cooking, I guess.


[User] Please transcribe this text

[Assistant] Heaps of fat in lamb. So I'm going to render that fat down and then cook the, cook the scallops just into that fat and get heaps of flavor from that. And then make like a pea juice and a few little things to go with that. Quite simple, but I think it'll go really well together.


[User] Please transcribe this text

[Assistant] It's just given me that extra fight today, so I really, I really want that today, yeah.


[User] Please transcribe this text

[Assistant] Having Gordon here for me is an awesome opportunity. I mean, not many people get to say that they've met him or even learnt from him. I'm excited for him to hopefully taste my food, so yeah, we'll see how we go.


[User] Please transcribe this text

[Assistant] Uhm, some pickled cauliflower and a cauliflower puree. I made like a pea juice before.


[User] Please transcribe this text

[Assistant] Gary and George are telling me I've got too many components on the go. And I'm not sure.


[User] Please transcribe this text

[Assistant] Alright, alright, thanks Gary. And now I'm, I'm kind of lost. Oh, like, I don't know what to do.


[User] Please transcribe this text

[Assistant] Regardless of using only one hand today, I really want to concentrate and get this cauliflower perfect. Yeah, that's the hero of the dish.


[User] Please transcribe this text

[Assistant] Time's ticking. Just changed my dish completely. And I'm stressing out. Brendan, how we doing?


[User] Please transcribe this text

[Assistant] With my hand injured it's taken me a lot longer to get all my prep done and I still don't have the lamb on and Gordon's not happy.


[User] Please transcribe this text

[Assistant] Gordon's freaking me out about the lamb. There's 25 minutes to go.


[User] Please transcribe this text

[Assistant] And I haven't even cooked it yet. He's saying it needs to cook and it needs to rest for quite a while, so I'm stressing out right now.


[User] Please transcribe this text

[Assistant] I cut into the limb and it's perfect. I'm really happy. It's medium rare, which is just what I wanted.


[User] Please transcribe this text

[Assistant] Cooking one handed is, I mean it's not easy. I'm right handed so. Like I couldn't French the lamb so I thought I'll fillet it instead. Oh man, it's crazy in the end.


[User] Please transcribe this text

[Assistant] Gordon Ramsay gets to taste my dish and that in itself is a once in a lifetime opportunity. After quite a tough week, it's a nice feeling.


[User] Please transcribe this text

[Assistant] Hearing Goon say different textures of cauliflower are perfect, I can't take the smile off my face, I'm really happy.


[User] Please transcribe this text

[Assistant] I'm going for the lobster burger today. Like a lobster roll kind of. I've had it before and I really love it. So uhm, yeaah. Quite sad on that.


[User] Please transcribe this text

[Assistant] My dish is a lobster burger and a brioche bun, a side of wedges and herb aioli. Oh, sticky.


[User] Please transcribe this text

[Assistant] But if I nail it today, I've got a good chance of going into the immunity challenge.


[User] Please transcribe this text

[Assistant] I've got all the elements on the go except for the lobster.


[User] Please transcribe this text

[Assistant] I just want to make sure that's cooked perfectly, like it can't be undercooked or can't be overcooked either, so I'm quite nervous about that.


[User] Please transcribe this text

[Assistant] I've chosen lobster because I think it's luxurious but at the same time quite unique like the other contestants wouldn't do something like that. So if I nail it today, I've got a good chance at going into the immunity challenge.


[User] Please transcribe this text

[Assistant] I think today with my lobster burger, because it's so unique and I'm happy with the flavours, I think I've got a good chance of going into the immunity challenge.


[User] Please transcribe this text

[Assistant] My modern interpretation of a lobster burger. With crispy roast potatoes.


[User] Please transcribe this text

[Assistant] And the sauce on the side? An aioli for the potatoes.


[User] Please transcribe this text

[Assistant] I'm gobsmacked by this dessert. It looks absolutely incredible. Jess Reese, we wish you were down here.


[User] Please transcribe this text

[Assistant] I'm kind of jealous of all these guys. I definitely don't want to be an elimination, but the skills they're going to learn from making this recipe is really, really valuable.


[User] Please transcribe this text

[Assistant] Jo's doing some really good work with her sugar cage. Like an octopus.


[User] Please transcribe this text

[Assistant] The strands that are coming off down the bottom. You just want to crush them.


[User] Please transcribe this text

[Assistant] Joe's twill's thick and has bubbled in the oven. So, she's already doing it.


[User] Please transcribe this text

[Assistant] I just hope she's given herself enough time to come back to that collar and get it completed by the end of the dish.


[User] Please transcribe this text

[Assistant] Dessert, please make him land. Not doing a dessert for me is risky, as it's outside of my comfort zone, but I'm fully aware that if I want to go well in this competition, I need to perfect all types of savoury cooking.


[User] Please transcribe this text

[Assistant] So I've only ever cooked lamb rack once before, so I'm not really sure how I'll go.


[User] Please transcribe this text

[Assistant] I'm a little bit worried that the lamb should be cooked red. I'm just hoping that it is just where it needs to be so that I can get tasted. Hopefully this will give me a chance to get into the immunity challenge.


[User] Please transcribe this text

[Assistant] So the next step is to start the lamb. I'm gonna start in a really, really hot pan. Just to start to brown up that fat a little bit. Oh, that's looking so crispy!


[User] Please transcribe this text

[Assistant] Yeah, so uhm, I'm actually gonna just finish this off in the oven really quickly, just for a tiny bit longer, cause I wanna put a little bit of mustard on it, just to flavour it through.


[User] Please transcribe this text

[Assistant] Yeah, not too long at all. And then I gotta say that I'm still working on, um, it's- Get in the oven, please. I cannot tell you how important that is to get in the oven.


[User] Please transcribe this text

[Assistant] I really hope I can do enough and get in the top five, because I'd love Gordon to take my dish. However, everyone's basically doing land, so I know today it needs to be absolutely spot on.


[User] Please transcribe this text

[Assistant] Oh no. My lamp's definitely rare, and I'm kinda concerned that it might be slightly under-


[User] Please transcribe this text

[Assistant] So I just used the outer sides, like needed 30 more seconds, which I think is just on the brink of being rare so that I can get tasted.


[User] Please transcribe this text

[Assistant] I'm completely shocked. Like, I wasn't sure if I've done enough. And I'm just so excited for going and trying my food.


[User] Please transcribe this text

[Assistant] What have you cooked? Lamb rack with cauliflower puree and then braised cauliflower.


[User] Please transcribe this text

[Assistant] I just wanna do something basic, so I wanna stick with the beef burger.


[User] Please transcribe this text

[Assistant] Hopefully can make it shine with different elements that add to the actual burger. What is the burger? I'm doing a beef burger.


[User] Please transcribe this text

[Assistant] Uhm, I really love like when you have this burger and you have bacon in it, but I've actually got the bacon in the mince.


[User] Please transcribe this text

[Assistant] Gordon really likes the sound of the dish, so it's really cool to know that I'm on the right track. Today there's a chance to go into that immunity challenge. And I really, really, really want to get there.


[User] Please transcribe this text

[Assistant] I'm making a beef inspect patty with jalapeno jam with a side of onion rings. I just want to make sure that they're really nice and golden brown. The crunch is really good when the judges bite into them. Those onion rings need to be perfect. That is so hot.


[User] Please transcribe this text

[Assistant] I'm pretty happy with my burger and my side. I think all the flavours work and I just hope now I've done enough to get into that immunity challenge.


[User] Please transcribe this text

[Assistant] I made a beef and bacon burger with lemon mayo and a jalapeno jam and then a truffle


[User] Please transcribe this text

[Assistant] Ciaran, I had the best side of the day with my onion rings. It's awesome. Can this day get any better?


[User] Please transcribe this text

[Assistant] Just freshness, lots of herbs, it's just absolutely delicious. The chicken is just melting in your mouth.


[User] Please transcribe this text

[Assistant] Little nervous, but hopefully I can just grow myself and get through this and...


[User] Please transcribe this text

[Assistant] The first thing I need to get onto is the chicken mousse. Chicken mousse goes in between the skin and the meat of pressed chickens. It consists of minced chicken breast, fresh herbs, and parsley puree.


[User] Please transcribe this text

[Assistant] While my pasta puree is chilling, I move on to the chicken breast. We got two chickens today. From the first chicken, I just need the breast, so I break that down, put the rest in the fridge later in the cook.


[User] Please transcribe this text

[Assistant] The next thing I need to work on is the roast chicken. It's the main element of the dish.


[User] Please transcribe this text

[Assistant] I grabbed my second chicken. I'm gonna have to break it down and remove most of the carcass, leaving the breast bone. The one thing that I'm really scared about doing is breaking the skin.


[User] Please transcribe this text

[Assistant] We don't have a backup, so I need to get this right.


[User] Please transcribe this text

[Assistant] I snapped one of my chicken legs, but luckily the skin is still intact.


[User] Please transcribe this text

[Assistant] My chicken is prepped. Now I need to put the mousse underneath the skin of the chicken breast. I'm feeling really behind.


[User] Please transcribe this text

[Assistant] It's really hard to gauge the thickness of the mousse in the breast. I'm just trying to do it by feel and there's no way that I can tell until I cut this chicken.


[User] Please transcribe this text

[Assistant] I'm just reducing the wine in the consomme. While the chicken's cooking, I'm gonna go onto the herb oil.


[User] Please transcribe this text

[Assistant] I'm feeling like I just ran a marathon. I'm proud of myself that I managed to catch up.


[User] Please transcribe this text

[Assistant] But looking at my dish, I realized, oh my god. There's not enough mousse on the chicken. That could send me home. I'm shattered.


[User] Please transcribe this text

[Assistant] But I know that I've made mistakes.


[User] Please transcribe this text

[Assistant] So, Sammy, vegetables are beautiful. So pretty.


[User] Please transcribe this text

[Assistant] Snow White and the Seven Dwarfs. Episode 1, The New Queen.


[User] Please transcribe this text

[Assistant] Once upon a time, there was a young princess.


[User] Please transcribe this text

[Assistant] Her name was Snow White. She had white skin, red cheeks, and black hair.


[User] Please transcribe this text

[Assistant] So Snow White lived alone with her father. They were very happy together.


[User] Please transcribe this text

[Assistant] Alone, the queen looked into her magic mirror.


[User] Please transcribe this text

[Assistant] Mirror, I'm the most beautiful woman, right?


[User] Please transcribe this text

[Assistant] Snow White and the Seven Dwarfs Episode 2 The Hunter


[User] Please transcribe this text

[Assistant] What? The queen shouted at her mirror. Who is more beautiful than I am?


[User] Please transcribe this text

[Assistant] Everyone says Snow White is so pretty. She's so nice, so perfect. Well, they will stop saying it soon.


[User] Please transcribe this text

[Assistant] He carried an axe. The queen whispered in his ear.


[User] Please transcribe this text

[Assistant] Let me go! Snow White cried. It was the hunter.


[User] Please transcribe this text

[Assistant] The horse reached a dark forest. Snow White saw black, tangled branches. Then, something else caught her eye. An axe hung from the hunter's belt. Snow White gulped.


[User] Please transcribe this text

[Assistant] Tears slipped down her cheeks. The hunter sighed and stopped the horse.


[User] Please transcribe this text

[Assistant] Snow White and the Seven Dwarfs Episode 3 The Dark Forest


[User] Please transcribe this text

[Assistant] How big is this forest? Snow White said. I walked for hours. Now I'm lost and it's getting late.


[User] Please transcribe this text

[Assistant] Dark shadows stretched across the forest floor. A chilly wind shook tree branches. Dead leaves blew through the air.


[User] Please transcribe this text

[Assistant] I must find shelter, Snow White said. She looked around. But where? Snap! Snow White held her breath. She stared into the darkness. Was the hunter coming back?


[User] Please transcribe this text

[Assistant] A faint light twinkled through the trees.


[User] Please transcribe this text

[Assistant] Snow White and the Seven Dwarfs. Episode 4. Seven of Everything.


[User] Please transcribe this text

[Assistant] A fire crackled in a fireplace. The room felt warm and cozy.


[User] Please transcribe this text

[Assistant] The second bed was too firm. She made her way through all the beds.


[User] Please transcribe this text

[Assistant] Finally, Snow White found the perfect bed. She snuggled under the blanket. Then she drifted off to sleep.


[User] Please transcribe this text

[Assistant] But it's a clean cut, said Rat. It looks like you hit something sharp, like metal.


[User] Please transcribe this text

[Assistant] This should be easy as. That is a piece of cake in my world. Cook burgers all the time. I'm really confident with today's challenge.


[User] Please transcribe this text

[Assistant] 75 minutes is definitely enough time for me to create a delicious burger. My approach for today's invention test is just a classic burger, just a beef burger using the mincer to mince my own meat. Hot tomato sauce, that'll do. Today's challenge is right in my ballpark.


[User] Please transcribe this text

[Assistant] I'm definitely not trying to reinvent the wheel today. I'm making a classic beef burger with fried pickles and onion rings. I've got my batter for my onion rings and fried pickles and now I'm going to concentrate on getting my meat ground for my burgers.


[User] Please transcribe this text

[Assistant] It's just a beef burger, we're just keeping it really simple. Yep. Uhm, Swiss cheese.


[User] Please transcribe this text

[Assistant] Uhm, so uhm, yeaah, just tomato and lettuce. And, uh, some onion rings.


[User] Please transcribe this text

[Assistant] Yep. I'm gonna have to get going quick smart.


[User] Please transcribe this text

[Assistant] When the judges cut this burger open, I really want a nice pink center. Not too undercooked, but not too overcooked. Having Gordon in the kitchen is like having a double-edged sword.


[User] Please transcribe this text

[Assistant] I'm trying to achieve a nice medium on this burger.


[User] Please transcribe this text

[Assistant] I've got no more time left. I need to get this burger out of the pan and onto my burger so I can serve something up to the judges. I'm really stressing out at the moment. I'm just not sure it's cooked through.


[User] Please transcribe this text

[Assistant] I'm really happy with the way that my burger looks. I'm just worried that the one I've served up to the judges is a bit rare.


[User] Please transcribe this text

[Assistant] Taking the dish up to the judges, I'm really freaking out about how that burger patty is cooked.


[User] Please transcribe this text

[Assistant] The beef burger with fried pickles and onion rings.


[User] Please transcribe this text

[Assistant] I'm definitely concerned about the rareness of the meat.


[User] Please transcribe this text

[Assistant] I just don't know how it's cooked and when they cut it open, I pray that it is cooked through.


[User] Please transcribe this text

[Assistant] It's just the worst feeling. I cook burgers all the time. This one should have been a breeze and I've just stuffed it.


[User] Please transcribe this text

[Assistant] Tomorrow's cook, I really need to focus. I was all over the shop today and I just need to put my head down, bum up and get the dish done.


[User] Please transcribe this text

[Assistant] So Khan and I are going to work on the poached Vietnamese chicken salad. So it's going to be really fresh, vibrant.


[User] Please transcribe this text

[Assistant] Why do we snore? I don't snore, I sing.


[User] Please transcribe this text

[Assistant] Snoring is a noisy rattling sound occurring during sleep. Oh really? I thought snoring is a pleasing piano sound. Please listen. Snoring is basically caused due to obstruction of air in our respiratory tract during breathing.


[User] Please transcribe this text

[Assistant] When we breathe, we take in air through nose or mouth, which then passes down the throat into the lungs. Normally, when we aren't asleep, our mouth parts like soft palate and uvula keep this tract wide open, allowing air to pass easily.


[User] Please transcribe this text

[Assistant] What do Charles Darwin, Michael Jordan, and Yoda have in common?


[User] Please transcribe this text

[Assistant] For centuries, a shining dome has been a symbol of intelligence. But despite this, many balding people still wish their hair would return. Scientists have long pondered, why do some people lose their hair, and how can we bring it back?


[User] Please transcribe this text

[Assistant] The full-headed among us have about 100,000 to 150,000 hairs on our scalps. And scientists have discovered two things about this dense thicket.


[User] Please transcribe this text

[Assistant] Firstly, the sprouting hair we see is mostly made up of keratin, the protein left over from dead cells that are forced upwards as new cells grow beneath them.


[User] Please transcribe this text

[Assistant] This cycle has three main phases. The first is antigen, the growth phase, which up to 90% of your hair follicles are experiencing right now, causing them to push up hair at a rate of one centimeter per month.


[User] Please transcribe this text

[Assistant] Finally, hairs enter telogen, the resting phase, which lasts for 10 to 12 weeks and affects about 5 to 15% of your scalp follicles.


[User] Please transcribe this text

[Assistant] But not all heads are hairy, and in fact some of them grow increasingly patchy over time in response to bodily changes.


[User] Please transcribe this text

[Assistant] DHT causes shrinkage in these overly sensitive follicles, making hair shorter and wispier. But loss isn't sudden. It happens gradually along a metric known as the Norwood scale, which describes the severity of hair loss.


[User] Please transcribe this text

[Assistant] First, hair recedes along the temples. Then hair on the crown begins to thin in a circular pattern.


[User] Please transcribe this text

[Assistant] Follicles might also lose the ability to go into antigen, the growth phase.


[User] Please transcribe this text

[Assistant] But while balding may look permanent, scientific investigation has revealed the opposite. Below the skin's surface, the roots that give rise to our hair actually remain alive.


[User] Please transcribe this text

[Assistant] And in the meantime, while scientists hone their hair-reviving methods, anyone going bald or considering baldness can remember that they're in great company.


[User] Please transcribe this text

[Assistant] Oh Rat, Mole cried. I've been so scared. Mole was shivering and tired. Rat patted him.


[User] Please transcribe this text

[Assistant] They're doing it, they're doing it. They're jumping out now. Full speed. It's on the lid. Look, we're now travel.


[User] Please transcribe this text

[Assistant] Sally, Tyson, we'll get those guys. That's not cool!


[User] Please transcribe this text

[Assistant] The Wind in the Willows Episode 20 Mr. Badger


[User] Please transcribe this text

[Assistant] He cleared away an area of painted wood. What is it? said Mole excited.


[User] Please transcribe this text

[Assistant] A name was carved in the center of the door. Mr Badger. Mole fell backward in the snow.


[User] Please transcribe this text

[Assistant] Nobody is missing from heaven. But I will arrest one horned buffalo for you.


[User] Please transcribe this text

[Assistant] But the demon stole my sword. I need more help.


[User] Please transcribe this text

[Assistant] I am so pumped. Uhm, I just need a cup of coffee and ready.


[User] Please transcribe this text

[Assistant] I mostly can taste pistachios, but I'm trying to dig into the bottom lab because I'm really curious to see if it's what I think and I think that it is saffron custard.


[User] Please transcribe this text

[Assistant] Going well, Samira? I'm making a pistachio and cardamom cake with baklava crumb and saffron and vanilla ice cream.


[User] Please transcribe this text

[Assistant] I'm starting to feel depression now. My nerves starting to get on me. And I'm really frantic. I'm not sure if my cake is going to be enough. I've lost clarity in my mind.


[User] Please transcribe this text

[Assistant] I'm having a second idea and doing this with raspberries on top. What is that?


[User] Please transcribe this text

[Assistant] I've got a saffron and vanilla ice cream in the freezer. And then I'm making a baklava crumb with a pistachios, almonds and cardamom.


[User] Please transcribe this text

[Assistant] Now I have finally gathered myself and I have a clear dish.


[User] Please transcribe this text

[Assistant] A pistachio and cardamom cake with baklava crumb and saffron and vanilla ice cream. I'm glad I didn't make a second cake. I'm happy with the one that I made.


[User] Please transcribe this text

[Assistant] My heart's beating million kilometers an hour. Oh my god, I hope they're going to like it.


[User] Please transcribe this text

[Assistant] It's a pistachio cake with salted honey and butter syrup, saffron and vanilla ice cream, fresh strawberries and baklava crumb.


[User] Please transcribe this text

[Assistant] Mmm. My tahini is in this yogurt. It's amazing.


[User] Please transcribe this text

[Assistant] What I would say about this dish is that it has a historical...


[User] Please transcribe this text

[Assistant] Importance in the culinary canon.


[User] Please transcribe this text

[Assistant] It can be immensely elaborate and whimsical.


[User] Please transcribe this text

[Assistant] And I love recipes which allow for that sort of wide range of creativity.


[User] Please transcribe this text

[Assistant] You are here to cook, so you should be delighted. The more you get to show what you can do, the more you get to feel your way with the ingredients, the better it is. And uhm, look forward to tasting.


[User] Please transcribe this text

[Assistant] And they will take time. Because there are quite a lot of those small steps that if you miss out will make a difference.


[User] Please transcribe this text

[Assistant] Can I just ask you what this is? Because I know it went through, uh, uh, various editions.


[User] Please transcribe this text

[Assistant] I really adore watching you work. Uh, you've got such assurance and a quiet confidence and a well-earned confidence. It's really beautiful and it's very inspiring. Thank you. You know, so thank you.


[User] Please transcribe this text

[Assistant] Beautiful, like a whisper of a dream of a desert. Heaven.


[User] Please transcribe this text

[Assistant] She makes me feel guilty, she makes me feel inspired, and that's such a gift to have.


[User] Please transcribe this text

[Assistant] Well I love, love, love that ice cream. I mean, to do, uh, pistachio ice cream so quickly.


[User] Please transcribe this text

[Assistant] You've got such a determination and a very delicate palette.


[User] Please transcribe this text

[Assistant] Samira, you gave yourself quite a big task, and I was so anxious, but you really pulled it off.


[User] Please transcribe this text

[Assistant] This is on my table at home so often. It's one of those dishes you, you know, you sit with all your friends and everyone's just digging in and taking some. And for me, that's at the heart of cooking, this sharing and eating together and being together. So that's what I'd like to share with you.


[User] Please transcribe this text

[Assistant] Always. Now, I'm doing a cake that is, it's not a kind of Masterchef-y cake. It's slightly rustic looking. It's quite old fashioned. I cook it an awful lot. It's a carrot cake with ginger and walnuts. Not a double layered one. It's a bit ramshackle.


[User] Please transcribe this text

[Assistant] Okay, I will. So I've got, well I've got aubergine and you've got eggplant. Eggplant, yep. Then I've got some spices. So what I'm gonna put in, I've got ground cumin and ground coriander. They are siblings. They, they are happy together.


[User] Please transcribe this text

[Assistant] Uhm, and I've got a sort of Turkish red pepper flake, it's called a lepo pepper. Have you ever come across it? You can see it looks like little chips of terracotta tiling, and it's lovely and lemony, and I've got a real fruity heat.


[User] Please transcribe this text

[Assistant] It's very, very simple, old-fashioned grandma cake, you know, a bowl and a wooden spoon.


[User] Please transcribe this text

[Assistant] I'm gonna use some of this beautiful Aleppo pepper here. Not quite as much now, I'm gonna add some more later.


[User] Please transcribe this text

[Assistant] Some toasted pine nuts. I like quite a lot of crunch at the top. And pomegranate seeds.


[User] Please transcribe this text

[Assistant] And this isn't just, you know, to make it look beautiful, it does make it look beautiful, but that sour sweet fragrance of the pomegranate and the sort of resin-y, uh, nuttiness of the pine nuts, it's perfect.


[User] Please transcribe this text

[Assistant] Bit more of the Aleppo pepper. This is so beautiful.


[User] Please transcribe this text

[Assistant] Okay, so this is a, this is a carrot cake, but it's not at all like the carrot cakes you may have eaten. It's kind of ramshackle and it's, uh, slightly more English. It's a ginger and walnut carrot cake. So I'm gonna, it's very, very simple, old fashioned grandma cake, you know, a bowl and a wooden spoon. Okay? Sugar.


[User] Please transcribe this text

[Assistant] Okay, some salt, fine salt, fine sea salt is better. Bicarb.


[User] Please transcribe this text

[Assistant] Baking powder and a lot of ground ginger.


[User] Please transcribe this text

[Assistant] And it makes quite a dry batter, but that's because you've got carrots to add moisture in a minute. It looks like fudge, rather divine. Yum. Right.


[User] Please transcribe this text

[Assistant] This is one, and I hope you don't lose sight of this sort of cooking when you're doing all these really quite nerve wracking challenges, which is, you feel the food and it's so wonderful, you smell it as you do it, you feel it, and you're, you really, it's sort of hands on, and that for me, cooking is really, you know, about that.


[User] Please transcribe this text

[Assistant] It's slightly coming apart, so I do the cornflour.


[User] Please transcribe this text

[Assistant] If you would, and I'm going to show you what I do next which adds a little oomph.


[User] Please transcribe this text

[Assistant] Okay, so what I want is to add ginger to that, just peeling it.


[User] Please transcribe this text

[Assistant] That's nice, huh? It's old fashioned looking, isn't it? Right, so... Not too fine a greater.


[User] Please transcribe this text

[Assistant] Okay, so we're gonna get a bit of kitchen towel.


[User] Please transcribe this text

[Assistant] I'm happy. That's all I can say to you. There you are. My ginger and walnut carrot cake.


[User] Please transcribe this text

[Assistant] Because you, you need to be confident, but confidence can't come unless you're competent. So that you can serve your own particular way of cooking best. And Christian, I can't wait to see you in London for afternoon tea and cake.


[User] Please transcribe this text

[Assistant] What did winning that pin mean to you? The main thing I got out of Golden Week was probably a bit more confidence. I felt it.


[User] Please transcribe this text

[Assistant] He was pushing us to do a bit better than what we were doing. Yeah, that's great.


[User] Please transcribe this text

[Assistant] Okay, so ganache is done. My time is nearly done. And I take the tart out of the oven. Uhm.


[User] Please transcribe this text

[Assistant] Do you know, I wanted to do a tart, but I'm not happy with it, so I wanna crumb it. And do a deconstructed tart.


[User] Please transcribe this text

[Assistant] I'm very happy with my ingredients. The choice of ingredients gives me a chance to be creative and elevate to the next level. So I'm gonna go all out.


[User] Please transcribe this text

[Assistant] Mmm, what are you doing? Making a roti stuffed with banana, cinnamon, and brown sugar. Sounds terrible.


[User] Please transcribe this text

[Assistant] Samira was done a great job. She has pretty much done everything. And it's gonna be a great niche.


[User] Please transcribe this text

[Assistant] Okay, what I was told is the dish is fig with mascarpone cheese and crumbs. We are making a pretty fancy cheese ball. The crumbs are in the oven getting ready. The fig is done.


[User] Please transcribe this text

[Assistant] The pistachio praline should just crunch like a cracker.


[User] Please transcribe this text

[Assistant] Mixing the mascarpone cheese is one of the main components in the dish.


[User] Please transcribe this text

[Assistant] It's a mascarpone cheese. But I'm not happy with it.


[User] Please transcribe this text

[Assistant] It's time to get up. Please start making breakfast.


[User] Please transcribe this text

[Assistant] The spirit of the planet Venus visited us in a dream one night. He said that one day someone would come along to save us.


[User] Please transcribe this text

[Assistant] So I'm going to make a carrot salad, which is carrot done seven ways. I'm doing a roasted carrot puree. I'm cooking the Dutch carrots in some carrot juice, carrot biscuit, some roasted carrot tops and some fresh carrot tops, as well as some fresh carrots and a carrot and whey caramel.


[User] Please transcribe this text

[Assistant] I'm gonna try and be really creative and step outside of my comfort zone.


[User] Please transcribe this text

[Assistant] I know only using one element in my cook is a risk, but I think it'll be worth it.


[User] Please transcribe this text

[Assistant] I'm using every part of the carrot, I'm using the skins, the carrot top, and I'm pureeing them. Because I'm only using carrot, I need to make sure that there's enough carrot flavour in all parts of my dish.


[User] Please transcribe this text

[Assistant] I've done my carrot puree and roasted off my carrot tops. Now I'm moving on to my third element and doing my carrot caramel.


[User] Please transcribe this text

[Assistant] I use carrot juice instead of water in my caramel.


[User] Please transcribe this text

[Assistant] I just wanted to step outside of my comfort zone. It's a chance to, you know, experiment and step outside of your box. Hopefully I'll have enough time to get everything on my plate.


[User] Please transcribe this text

[Assistant] I'm really happy. I think it's delicious. So uhm, there's a lot of carrot flavour in there and hopefully I'll get tasted today.


[User] Please transcribe this text

[Assistant] I'm not sure how the judges will feel about it but even though there's no protein in it, I absolutely love it.


[User] Please transcribe this text

[Assistant] It just seems so surreal. Such a good feeling.


[User] Please transcribe this text

[Assistant] I opened my eyes briefly and then realised that the people that were presenting the spiders had spiders all over them.


[User] Please transcribe this text

[Assistant] So you gave the right answer, for the wrong month, you get no.


[User] Please transcribe this text

[Assistant] My time, I have to get the, uh, ice cream on. I have to get the honeycomb done.


[User] Please transcribe this text

[Assistant] It's, uh, an ice cream with honeycomb.


[User] Please transcribe this text

[Assistant] Oh, it's stressful. I tell you I never thought it would be this stressful. There's no time to think. Chocolate, chocolate.


[User] Please transcribe this text

[Assistant] So I decide to make a chocolate sauce and make a macadamia nutcrumb.


[User] Please transcribe this text

[Assistant] Barbecue king prawns, olive oil poached fennel, chilli and lime.


[User] Please transcribe this text

[Assistant] In our chronicle of English literature, we're now at the turnover between the 18th and the 19th centuries.


[User] Please transcribe this text

[Assistant] Something very interesting, very important happened at this period. It's conventionally called the Romantic Revival.


[User] Please transcribe this text

[Assistant] Now, the term revival actually sounds gently to the ear. It's the kind of thing one can imagine dusty scholars doing, digging in archives, reviving things, bringing them back to life, revisiting forgotten styles and subject matters in a spirit not of fury but of nostalgia.


[User] Please transcribe this text

[Assistant] How charming those old romances, by, what was his name again, by Mallory, how charming they are. We can imagine a revivalist saying.


[User] Please transcribe this text

[Assistant] But what we actually see happening in literature over this period could, I think, much more accurately be called the Romantic Revolution.


[User] Please transcribe this text

[Assistant] And the word revolution carries with it all the ferocity and danger that we associate, say with, with Robespierre.


[User] Please transcribe this text

[Assistant] Old orders are falling, and with it new orders are emerging, but with a certain kind of violence.


[User] Please transcribe this text

[Assistant] Now, historically, in the real world, not literature, the period from 1796 to 1798 is an age of revolution. That's what the historians call it. We can go back further to the American Revolution, 1776.


[User] Please transcribe this text

[Assistant] Through these events, it must have seemed like chaos. Come again.


[User] Please transcribe this text

[Assistant] Now we, with the advantage of historical hindsight, see it as the emergence of irresistibly reshaping energies of reform and renewal. We can see the architecture, they couldn't.


[User] Please transcribe this text

[Assistant] Now, the most famous historical revolutions are of course those in North America and in France. And the reverberations from those cataclysms, 1776, 1789, would shake the whole globe for half a century. And their effects are still major features on our world geopolitical landscape.


[User] Please transcribe this text

[Assistant] And as we'll see, English Literature II partook in the upheaval and was reshaped by it.


[User] Please transcribe this text

[Assistant] Now, the literary timeline we're looking at in these lectures was materially bent, bent and redirected by what happened in the years 1770 to 1830.


[User] Please transcribe this text

[Assistant] As a general observation, revolutions presume certain conditions and share certain general features. These may be listed as intolerable oppression.


[User] Please transcribe this text

[Assistant] Which is finally, and often violently resisted, revolutions are not polite events.


[User] Please transcribe this text

[Assistant] Secondly, revolutions are typically a movement of the people. They are populist in essence. They come from below, not on high.


[User] Please transcribe this text

[Assistant] Thirdly, revolutions have a program, a vision, typically utopian, relating to some idealized future perfect state of social existence. Revolutions are in essence prophetic and millenarian.


[User] Please transcribe this text

[Assistant] Often they're secular in motivation. They offer a paradisal vision of the future which is not Orthodox Christian or Orthodox religious. Now bear those three elements in mind.


[User] Please transcribe this text

[Assistant] As we shall see, they help understand what happened to English literature with explosive effect around 1800.


[User] Please transcribe this text

[Assistant] And all these three conditions that I've talked about are relevant.


[User] Please transcribe this text

[Assistant] But first something about the revolutionaries we'll be looking at themselves. In this case, William Wordsworth and Samuel Taylor Coleridge.


[User] Please transcribe this text

[Assistant] It's significant that what these two writers achieved with their most incendiary and effective volume, lyrical ballads, is that rarest of things in English literature, a team effort, a collaborative work of creation. Now literature of the modern period from Chaucer forward in our terms,


[User] Please transcribe this text

[Assistant] It is normally invariably rooted in individual sensibility. The author is a single entity, a single voice creating highly individual literary artifacts.


[User] Please transcribe this text

[Assistant] Literature expresses at its highest level of articulation the self, not the collectivity.