00:01
Always captures a zero in the top. In the theories. This way the processor before the last, almost picks up data from the same spot. Doesn't pick up data from different spots of different times. Uniformity is very important. Yes. What do you mean by when a zero comes in for?

00:26
So you have the zero and what type of zero here, I'm pretty sure because I really and I keep it in B and then how do you go from when I think of the next be valued from my neighbor I put it in. Hey, right, because this is a, you see, I'm a process.

00:45
I'm a computer. I can do anything with my I have. I don't want to change of property of the communication every time the state changes. I want my interfaces to the property mistake. That's important things. So they don't know what that we do and keep the idea of these and the book is about

01:22
So here is this is a beef. Yeah. So basically this processor is allowed to read this be here. So it sees is zero here as a normal statement there. My next time when it sees a three because it's inside the process of the pasta market. This guy doesn't know nobody else knows what's happening inside.

01:49
That's four different. I had a solution before my job where he put a zero in and if there was zero in the a position, you put this back and then just but No I always read from here and then make a decision like what you impress that you statement, right?

02:14
And yeah, the nice thing is that all the processors, have to be absolutely cement. I mean, identical from it, all you have a zero to be different actually, you know, I can make a zero to be identical. So, if this guy has, you know, it's ability to read something from the register there.

02:39
The last guy in the end's process role, still has 15 there, So it's expected something. So if you don't put anything here, I mean the code is not going to compile because it has exactly the same code no matter what you're wrong.

03:06
Thing. Also, when you write the curve, please think of the reader, I need to be able to look at everything. Three seconds to tell the charger, I'm spending minutes and minutes and minutes and minutes. Trying to figure out and I'm still not sure if the end of the code is quite, make it down based on, you know, cases, I mean.

03:29
So that's one group that, you know, play the trick where he doesn't test that the process on his own. All the proud oldest statements who testified last Arizona because we saw some beginning, but in one, they tested this on, but he once said once situation, they don't. Because if you get the data from this, from this spot here, obviously I'm on.

03:59
But this means this really is not for when you try the circus you will not make exceptions. You don't basically how to expect to see, you know, one, hi in every single statement that you buy and we've always becomes all of you here returning to turn the processor off.

04:22
They none of them execute and I can, I can look at that because I was actually understanding what the program does. I can say. Yes, they are journaling of the program because I can see that that said, same conditioning, say the same. God is every place so laid out to the form if that's separate cases like, you know, if the code the corresponds to being a middle middle node and also it together, leave a blank line maybe with a parallel body between there and then the code that is when you are the last one, you know, put it together and seems like that.

05:01
I mean to separate separate. Essentially, I can read it without actions having the Spanish. So by simple synchronous, you mean there is some kind of class thing Once statement in the entire system. Oh, that's statement. It's mapped to n plus one process source. Oh, it's this is a bit at distributed to the different processors.

05:28
So, the code. So your code bas should look like this processor 0 codes for processor 0. Not, although, about high one eye. And so this basically says, I have n processed source and the code for every one of them is the same code for processors. Hi, and it's the same code.

06:06
So the loader basically, picks up the scope composite, but things have this code and that's it big, big big, and then the way the system works because the global crop that was distributed from one load of processor and the clock says next and they want to come up. And then the clock says next.

06:26
They don't it's all time. If even the number of ends, whatever internal should this program already type your one because the last one has to know. How do you, how do you stop a program from running? We don't, we don't have an exit in unity. So, you have to model.

06:47
The fact that is all the program that is off is a problem that does nothing. The program can do nothing. If you put on the card, you know, you would only do it if you're on if I turn it off. So that's what the doctor needs that particular, you know, variable actually called coded as some sort of bit on the, on the controller of the of the processor that returns of the process, or no power doesn't use power here.

07:15
The best on here because it's another one and all three days, you know, something over here. What you see says, I am on, or I thought, and every line of code here tests that this, but this doesn't, that's nothing. If it's all type. Yes. Okay, and create. Okay, so if there is a clock single signal to, we have to consider partners back says synchronous.

07:52
Oh, how it's actually circuit wise implemented? We don't care. I don't care. Oh model, this synchronous system using the community notation also, we don't take this and comparatively to the particular assembly language of that particular, microprocessor or in the microprocessors around this board which is designed to be a synchronous board.

08:17
So they all get a signal they don't really get the clock signal, like I would say. Because on the interface there is a overview and new value. So, how do you is the difference between? I mean if in hardware when a clock signal cans, the value is updated to the new one.

08:39
Mean they all read in the same step thing. Oh awesome. So then in reality, what would happen in a system like this? The chin, you something the peaks. So have a particular ping which you see the control pin and the controls being basically would go up had a certain frequency and then the processor will probably synchronously inside and what it's finished would basically, you know, tell the the other being I'm done and then the and then the controller.

09:25
Okay, everybody's done. So then it's pulls a line up again. I mean, that's what would happen. I mean, there are many other design but this would be one simple straightforward design. So no, I mean the point of the community model was we can model anything in the world, but there is this mapping between how you model it and then how do you know implemented the lower level time to close.

09:56
It has the wrong itself, controlled and the gloss. I mean, there are many possibilities for this. Each one has come heavy. Tom clock was like okay because I work, right? So so each one has to turn back but it doesn't do it work until it gets a single girl extras.

10:15
Then it works on the next task and it's done and that's why we have to make sure we don't create confidence. We don't get a situation but somebody's writing to the register and readings are excellent. The same in the same phase, it's possible that could be the circuit can be designed to be multi-faced.

10:32
So you know basically phase one everybody reads phase two, everybody scores phase three everybody, you know, updates phrase, four, you know, want to get the menus, you can possibly implementations. We don't care about that. The point is that we can capture the essence of the process.

11:02
You may say a little kind of a bit, you know, How do you broccoli to low level on this in the kind of in our thinking? But the truth is that if it is adding process on today, watch on the processor. I mean, a lot of things but what are two important things, there is a list of microcontroller, at least one and at PGA family.

11:33
If PJ property, is that seconds liquid circuits? You basically ride the program and it's mapped to that circuit and it's actually executed as a circuit as a most of all most of the pipeline. So the pipeline of gates, since come from one end, and they go through the other end.

11:53
So, you know, the high level in the low level things. Start coming together in interesting ways. When you talk about a security then you know secure booting is important. You have to be very careful about synchronization there, so you don't want to problems where somebody can can sneak in some code that is not it's not very fine certific.

12:27
So, so, yeah, we have the ability where I try to put. We have one notation which is fun. It's under this place. We can because we can do anything because that's nice but that's angry. There's a way of thinking that there are learning to this class on how to thought functionality and other lying how to program for different kind of systems.

12:52
So all of those are the import encouraging his exercise first. So last time we put you on the shortest path.

13:09
And we had a picture of you.

13:26
Sorry, doing this, this

13:34
That in. And this was,

13:44
City. It's like a waste. And if you remember this application was

14:02
Is.

14:07
Equal or 7.

14:13
Because some of you people arrived, these things you need to be proposed. We just want me to defrost from this specification. I mean, after I write that force, the so these are very important. Our program and capital D is, the is a shortest distance because entire put in pair of edges, every pair of purchases shorted distance.

14:45
So these so this is the result, but it's not the stable pause, is the little bit different from the fixed point which that just two different ways of doing it because it's fixed point. And then you can see the fixed point implies whatever results you want. So he's a the program terminates, our programs, all I mean here, they're all going to terminally, so they all could be equipped.

15:14
So we could, we could basically write this

15:23
Is.

15:27
Needs to it's going to expand advice.

15:36
Radical nothing. He just if a program has no negotiation. You can't use this phone. It's justification. It's impossible to impossible to use point. Then you can, this can be used what they have. So this is more general is And so if you remember the way. So we basically, we know some, we started writing that we were the fixed point and then I added the new value and the metric.

16:14
And after all that, we went up with a program, which was something

16:35
In my notes I made you maybe even find a body thing. Usually remember we at the very beginning of the class, we said that it doesn't matter to these part of the bar or box and you can kind of use the hose but you can make these things by using the part of the box.

16:51
So just use maps, the only good that code is.

17:06
So basically the radio, we initialized the initialized D with the age weight matrix, which was computed basically, if I am jail neighbors and they had a value for them, there was an edge for my day is a way that was a way to. That's what W is in his will not neighbors, that would be infinity.

17:32
And if there were five different channel busier, there's no way better. And then the sign.

17:52
I'm going to, I want meeting the fact that I enjoyed my supposed to be.

18:01
Perfect. And I know third righteousness.

18:34
So what you do, what it is here was basically we took them the valiant which was the idea is equal to minimum and inflation is an assignment. So now 29 at the front of the fixed point of the computational building here because we know that we can copy the fixed point of this, which has to place a coordinate you, and we need each other opposite.

19:04
We try to submit since we started. This specification, that was a hint to us that this could be a possible solution for the of the program. And what this basically says that if you have high and if we were to say you, you pick up other places, can sell the distances.

19:32
And although, all these distances, you take the shortcut so you could go to, Chicago would be three hours, even your names again? Eight hours because Saint Louis only five hours. So you go by all the try, all the paths that will take you from Michael J. And you know, you think the smallest on them and we get, we get the if there is none is not fast this inside.

20:08
Okay. Here is the 45 is once it's made, fine. Yeah. And I all employed, I'm not, I just not writing the formula down that whole vertices product that workers is in the process. So, I can pay for this example that all zero, one, two or seven. It's just, you know, just too much like it and in the book basically they use a double column to say.

20:38
Well, the domain is implied and you know what I mean?

20:44
All right, so this makes perfect sense and it was a nice uristic to start it with the formula. And then you make it into action that accomplished the same thing and fixed them. I mean there's going to take a couple of iterations to because of itself. So, and actually, the and the number of information is it's in another

21:18
So, you don't get this, you don't get a fix pointing one. One single side. I'm gonna go for a couple of things and is every with every every time it goes through it, you're gonna improve the value. And the meaning of eventually, you have you got to really do that stuff.

21:39
Making more on. So, another thing we could do is

21:56
Okay. So, what we had here, we had the fixed point, basically was DIJ people name K, the, my case was, so this is a fixed point for all, you know, this is a fixed point for this right Now, there is another way of writing it, which is basically saying.

22:28
So, this was For all I JK.

22:44
By J is equal to the minimum we can be by J and the I k plus the game shape, This draws the same thing, There's not no difference. I mean, like, basically, you know this, I'm not doing the meaning overall in this, basically, you know, where comparing the minimum of the energy in, you know, again or okay.

23:19
So that's suggest that you provide any program in which basically instead of doing this, we can now he plays this particular equal to colony for impedance program. The diabetes thinks that the same people. So, when I get there, basically a program where the sun sections of

23:54
The size section. We have rocks. J, K and England, VI cover

24:18
Okay.

24:27
So it's really the same programming said that we place to the minimum of DIG. Now notice what I had to do of box because he's all now they so okay could be want to ensure if I had part of that and then the minimum DIJ and fever blouse, one, two and three and they could be three different numbers.

24:59
So then I got a conflict of the IK because I'm writing, okay? I guess three different values and say the same step. So to avoid that, I mean to avoid right? Conflicts, I need to go to this. Here they saw right? Because the IJ is a side. This expression and each.

25:21
GIJ is different one. One, one two, one. Three zero one because they do the same exact same thing. They're doing preference over them. Well, it depends on what place you use. Okay, so from this architecture and the different, basically, we said that we can we can do it with if we have any process or can do it.

25:45
Basically, in log square of any steps. If we have a different architect employee. In this case here,

26:00
Want to see question architecture. We do it in cubes steps. So, we'll take

26:14
So, we need to do the architecture. And the guy also, in this case, even though we compute things separately, because the conflict, we have to, to believe they signals. We Now it's interesting that actually wouldn't have worked happening. Here, is that?

26:48
Maybe we should look at what we should look at that diagram there. So if we don't think of this programming, take these 03.

27:04
Well, so I am James speaks for us. He can be better. And so, if we so deeply. Okay. 0 1, 2 3, within order, like that. There was going to happen that we've been against a minimum minimum. Well, whatever busy okay is well, initially infinity because there's no connection Many more this and the zero.

27:39
Zero three, right because you know k is 0 here. So 0 0, to 0 plus 03. It's infinity. So really 4k to 0 to get 0, plus infinity. So, there's no change. This is what we say now I could not do one, we do v01. Zero one is two plus two three.

28:22
He's two, three to 36. So now this actually results in a replacement because the sum is smaller than this. Then what? We know that now we could do it. Okay, maybe two, then go zero two. It's a three. And then I'll do two three, it's a two. So, I'm going to sleep as two and now, this is smaller than all value.

28:56
So now this is becomes the newest value and then if you want to do three, we do zero three which is infinity plus 0. So any plus 0. So this is no effect this stays in this way and you keep on doing this until we get the. I mean obviously in our situation here because our own clinic which has a we can get the solutions in kind of one, just one separate iterations but even a large network we have to do an alternate interactions.

29:37
Like I said thank you to actually get the final result. The interesting thing is here, is it actually? We can think of it. And basically having so we have three numbers. Okay, I enjoy. And we are playing with this, his numbers we can actually do this on a business.

30:09
I mean money would do a sequential version of this program where we increment. I J faster than K. So for a given K, we look at all IJ possibilities and for the next gate, we look at all IJ possibilities for next game. That's all. So if we do that, we actually hang out with this equation.

30:34
So we do this as one single number. Okay? And so we ended up in a sequential program and just so the way that could do

31:30
The same 84 eggs, you the are neutralized as

31:42
So basically set the 21st thing that you compare is from 0 node 0 to 0 and the first thing you compute then you're going to compute it from 0 to 1 via.

32:12
Then you go here and, you know, you kind of this by one and then you go back, okay? So what? So, the sinus on it sign because The colony home, minimum the cover.

32:48
X the next week.

32:58
Notice, there is no qualification here. These are dummy variables, whatever you read, These are actually fixed values. Some nation. The first time he was zero, and then what we're going to do in this

33:20
We gotta do we when I hear them xb but if it actually is, if it's one number like three bytes. So we have an exactly like good increment. You know, by numbers would be actually B plus 0 0 1 and you can see how you're gonna increment the V power, the battery overflows.

33:49
And when you go overflows, you get the one here and then you go back in the increment, this one, and then go overflows again and again. And then when this overflows, then you finally move this one.

34:03
Right. Yeah. So I mean if we if this is a number like 0 0 in decimal, let me do zero. Zero one zero, zero two. Eventually we can zero zero nine and we need to zero nine. We move over so zero to zero one zero. So we've got the test and then we go again, the zero one, zero one, and set it up.

34:31
So conventionally this guy's going to go over. It's going to be a nine, give them, and it keeps on doing that again. So I guess he's going to take MQ steps because that we have for each variable, we have n. So we have hand values here multiply by nine hereby angles here.

34:52
Thank you to do this only if it's not where I'm not done.

35:01
Thanks you of constant and minus 1.

35:11
So it's not equal to 999 because I'm at 9 because now to the thousands and you don't use doing nothing after all. Yes. Even if you had zero one and longer You have to go through all this and because sequential, that's what's happening here. So how we end up with this program will end up with this program because we said we have program and we notice that we can as it if we schedule program to place it in a particular way.

35:48
So we're actually the way really the thinking went is that I have programmed to find so I need to map it to an architecture. What kind of architecture? Well, one possibility is a sequential activity. How can I optimize a methodist sequential architecture? I can optimize it by running IMJ faster than and that's gives you handcubes and keep steps.

36:16
And So we may not observation and then say, oh, I went on, I don't, I make that explicit. So, basically, we have exists to make it make the control. Exactly explicit. Notice we don't have a back here because we have guarantee that when we, when this ends, the fixed point is going to.

36:44
So, we don't need to. We don't either as soon as special that there. All right, nothing's interesting. What how?

37:01
So,

37:06
To improve products. We are going to produce a function, take high, and this is going to be the shortest.

37:30
Path from high fuel j from this. I'm using vertices 0, so k minus 1.

37:55
So really, I mean, so this is a this is a minimum when we use quality this and you can see why because we're implementing K once every time. So usually we go through zero. So compute, all of those were done. Then we could go to one, hope. All of the square time go capable to feel complete to all those.

38:23
And so if you really look here and then you get some color

38:43
So if we take okay is equal to zero. Okay.

38:53
That yeah, no notes that you have to go through. So basically for k equal to zero, we get is not could get distances from 0 to 0 from 1 to 1 from 2 to 3 from 6 to 3 because our rock using any intimidating tests. Then people one, then I can get passed that goes through zero, because not as it's just gain minus 1.

39:30
In case 1, you can get from 0 up to 0, right? So one of the passages through 0, Well 0 to 1. So we didn't get this one and 0 to 3, 0 to 2. You get this everything else doesn't close with zero so we don't. So, so we have these are the minimum paths.

40:00
That only use them, we set these securities asleep. And everything else is infinity, then he would go okay equal to two. Now we can include one. So now we have passed, it goes to zero and one of you we see from zero to one already done it so now we take from one to other places.

40:20
So, now this adds these sex that it's only stand, also,

40:32
And also add this one. So that's so like from 0 to 2 by using 0 and 1. We get this distance with 3 from 0 to 3 using 0 and 1. We get 2 plus 6. We get 8 and then when we go to cable to three now we can continue consider the true as well.

40:59
So that adds this line to the equation. So now we can have the past that goes from 0 to using one zero one or two. So if you use one we get eight in the good two, we get five. If we get one and two, we get five, so you can see how it was, and by gradually considering more and more.

41:30
So you can. So this is a kind of the function that we need to to bring into play and so can be able to then find you. Maybe an informal definition into people's forms, So Here, which is the same as because it's time to use any paths in order between.

42:08
So if you're, if you are the distance from you to yourself is zero the distance to you 240, tells a charger connected to is whatever that the businesses.

42:27
Then into age, I drink plus one, you find out

42:46
Okay.

42:52
They So you see what's happening. When you consider also an old K which was not in the past before you basically, you have the old pass that people use. Okay. In it, and we had another pass and we had all the paths was came. So then we go from.

43:17
I okay using k minus once places and that's already populated and from k to j using k minus 1 that is not k and the other two and then I take the minimum across all of those. And again there is and and to show that these definitions correct basically, which has been to those who have some induction process and show the place, the base case is zero.

43:53
And then we can assume that in course for K in short, okay? To. So if K is actually on the task and you have the minimum to it, they can come to office. Right. If I know that case of my past and I have two lines that are both meaning of, okay?

44:16
And when I sounded, I had to short this past using case. Well, and that's the way that that's actually

45:04
Okay, so this week we could we have this definition, I have this but at all to improve before. No, this goes back program.

45:29
And see what a program does.

45:35
So This isn't about you.

45:47
And they've operated for all the values of us. Now you can keep x fixed which because x is actually incremented as close going to give an x. I can have. So let's say x is 5. I have one three to seven zero one etc. There. No complexity. They all can be done in learning panel so we can take this sequential program can actually make it easily television a bit.

46:27
And the way we do it is I doing all this, you be updates, internally and then, if you're going to be gay by the end I want. So what we end up having program?

46:54
Is before we've got a science section in terms of something like this, I'll j DIG or an equal to be here. If okay smaller than any parallel. Plus one. Okay. Small.

47:35
So here's a different duties. We look at the program that we ended up with a program that was sequential was highly controlled, and there was nucleus equation, code and sewing at a whole bunch of things could be done in color them nor they don't have to be done section.

47:53
So we restructure the program. This is the program instruction, we use modified, the code, we factor the code that's turned itself on use in industry. So you refer to the code and I'm going to now you know, all the seminarians. Somebody uses K the old diabolier because there is no, there is no comfort on the back so far really okay with all of the ideas.

48:24
So you can do that and communicate after every parallel execution, implement k by by one. And then we do the next then the next thing parallel, let me kind of k by one through the power and so couple of tricks or years, we started everything variant. Can be very space point.

48:49
Change the equal to colon equal and we got code crystal, the modifying guidance because so that they cannot modify the code to again to call an eco. The fact that I, we know, these are going to particular architecture in trans sequential and you can control the sequential flow to the exactly when it's done to give us a fixed point of the collaborative, then we did the proof by using.

49:22
You know, that's this age function, then we look at the factor, the code is equal, but some seems that we are not doing sequentially. Could be done parallel. So now it was a code that gave us a hint from how to recover as opposed to having their functionality. Well, here is the weirdest thing that we can do.

49:54
So I'm going to write a program now and then, So this is program.

50:08
Is always saying canola section we have? Why do my baby eat?

50:27
This will be nice translation. Remember one now it's over.

50:39
Okay, or an equal marks on the chain page. I JK 8 + 1. = H, commits command. Minimum they'd probably. Okay. Come on age.

51:07
Okay. Okay.

51:14
Jay. Okay, those of crimes as a skillset box.

51:28
Okay, Jane equal the page again.

51:44
What do they know?

51:50
One. We know that equational program, we do the definition of H and brought it in the hallway section. No, remember that? It's a problem. Most of the time we have a problem with that because we don't have a cursor but this is not recursion because I can line up the statement in the proper way and these me, I set those statements and then I can actually execute them, you know, according to them.

52:30
So see. First here, I need someone, but here time can you tell NK one step in a timer time and get the same effect? And then when I'm done, I need that final result. And the final result is then assigned to D So we can do that because the equations can be organized in specific order.

53:03
So every equation depends on the previous one. And there's no decision. So see this can be, this can be replaced. If k is x, a is 5. We replace this with 5 things in that particular order.

53:23
If they stand any places with fences since we can write all those, all those equations in a way that only depend on the equity above it, there's no, there's no recursion and therefore we can compute result. And again, they are programming languages called equation of programming learnings in, where this is the way program sticky.

53:50
But and the compiler, it's an equation solved, he takes an equations and write C code that solves their equations and delivers, the result, the sound of the. So very interesting how, you know, we can take use the proof that, of course, thus being up, some definitions. Then use those definitions to write an equation program.

54:20
And now, you can say gradient program. You write a sequester program, from it, basically, just think of everything. And, of course, I have equal. I just do color equal, and I believe in proper order. And I get the, the program that, you know, and assignment program which is similar to the what I have there.

54:43
So the people who are really interested in companies derivation the innovation aspect, I mean, they developed heuristics to think about the problems and get hints from the way in the formula looks in. A particular way, you know he has a for all x that may suggest. Something if there's an existential that may have another suggestion, if you.

55:12
So the use of patterns of the law of the logic formulas and from those derive ideas on how to refine the code and define the, the program that proves themselves on the specifications because there it is. I mean, so, you know, it's very high level intellectual intellectual game. So the this night, the Dij equals H.

55:46
So remember the definition of HIV and is that, it goes through all the, all the and minus 1 use use unless one processes.

56:11
Yeah, it's just from 0 to n. Minus 1 any the number of vertices. So the vertices are the mark 0 is minus 1. So the means that is the shortest fast going through all possible vertices in the system, Now the questions.

56:38
Anybody watching Foundation has the most. There's no asking. Is that in some sense, that's sci-fi mathematics. Place an important role. They premises either development, I think regions became predicted the future that macron level, anything and disability doesn't like what you're predicting. You're not presenting a job. Yes. So for you met some unity to sequential architecture, you need to use stocks?

57:23
Well we'll use because it did one step at a time. Oh so there are many possibilities and we only take one possibility and met it to sequential. We control them. So if you use box. Yeah, controls Monday statements are executed. Oh yes, statement was determined by the bioincrement in K.

57:48
Oh, there's only one one next step that can take place. Oh, it's because every time we went through it, Lincoln and I came by one. He can make it. I want to go one thing that would happen. So increment by K is used terrible about with some other stomachs.

58:07
So wasn't done with their computation. Oh, patient. Okay. Oh, All right.

58:34
Great. That's what?

58:44
How many questions?

58:52
All right, we'll make some teams. All right. So you make symptoms of sleep.

59:06
So that came one into three In one, in two teams. Three one, two, three. And you go to the one, okay?

59:41
From there.

59:46
Other team learners always there. All the way to the back. All right, so that's good.

1:00:13
Here also came on. Yep. All right. Let's see how the best do this. We go to the corner and use like two. Other turns facing. Okay. We can your internet, right?

1:00:37
Yeah.

1:00:41
All right, we have a company that includes holding So and the family provider so I'm running you know my sci-fi movie and you are the recipient. So how do I deliver this movie trailer? One way would be to create a connection for each one of these. So that's very expensive, company everything.

1:01:27
So, they may be doing, if generally walking, by these kind of communication, you create a multi-castry. So basically I send to some note of sense of, I'm not saying some notes and then everybody gets gets the contents. So, the packets, some good deplicated and set the nodes and center the to the children.

1:01:53
So, if you've seen the origin amount of movies and root, you know, whenever you hit a branch, you duplicate it, then I'm just going to get the same thing about the same size, yes, slightly leggings, but that's why I use buffer you saw TV. It goes, 3%, 4%, 90% and then.

1:02:14
So using this many many where this country is the system strategy. Yeah, they forfeit problem. Is it sometimes means break. It's all of a sudden, a whole section of the country. Doesn't get nothing in the movie. So what do you need to do to that? You have to impair the training.

1:02:44
So, your task today is basically understand what the nature of the problem.

1:02:55
Of work. Fair means certain like the code on the sketch with sketch out using and then start looking for my proof, the code. Okay, so I'm going to take a graph.

1:03:29
Okay.

1:03:38
Right. So this is a graph and we've got the Spanish and this. So, let's start with this node here for our purposes, done in the matter where the source of the data council, which has need to make any span entry, the data will show. So, I just, when I was stationed, I'm putting there.

1:04:00
So basically there's one job here. There he decides to have Michelle here. It has been a child there. One of them.

1:04:18
All right, that's fine for the spelling frequency. It's an excellent tree that.

1:04:30
Ground and any word that any edge that's in the trees often put under. So the problem is repair. So at some point what happens is that the link goes down so I say this link over

1:04:55
You notice that we could run the barberism again and putting our positions node which is this branch. And then playing which was that and ended this interview, okay? But writing down again, hit or million nodes on a billion nodes, so limited expenses. So what we want to do is come up with a protocol and that, and by the way, the protocol that we're going to come out, we can come up with just probably almost as expensive as as running though.

1:05:35
They're all Spanish. You better high level? Okay, excited. We need to come up with waterfalls and he builds it. So in this case, for instance, we could add nice. We have this cutting fail. It's another. So,

1:06:10
First step. Do I understand the problem? Yeah. How a question? It's after the only one page will be working. Okay, so for purposes of our world with someone no more than one edge can die the time, okay? And this is very common in failures, very system with some single phase, simple product value.

1:06:31
So we have one failure and take another one but by the time it comes again, we already repaired. So you just need to prepare the three ones and other ways Doing over the failure of the earth. I mean you and God you know has network good The notes that knows each other on behalf of each other.

1:07:02
They know, they are communications each other And they may have a heartbeat or maybe a lot of procedures this, so they don't get the heartbeat. They know that the link. So, the answer is both hands of the of their age, that fails to know that failure is. So I'll go is just reconstructed.

1:07:27
The just, the reconstruct Spanish tree with some connection with two parts. Well, we need what? Because yeah, we need to rebuild the tree but not by having the standing preferences, but finding another product called that supposedly is less expensive, because it's not rebuilding the tree from scratch repair in the cheaper.

1:07:54
Scratch also would have the implication that everybody's transmissions are disturbed. While if you just repair it sometimes it should be delayed but because of buffering, you know, we're not. So we needed to find somewhere to add in one edge. To connecting them all. Yeah. Okay, any other way.

1:08:21
So the idea is, I need a real comment for the reconstructed age. Is I need requirements for that? Would you which edge? Oh yeah. We could add. We want to use as long as we build the Spanish. That's all we need. Okay, Now I should point out that. I mean, and password, this doesn't exist and this has an part of the building audio tree.

1:09:02
There's no way.

1:09:07
So that's, that's a problem. Now, you should write this because so basically, you could either specifications naturally in two ways. One is that, you know, there needed broken and is a possibility to repair and repair, and there is no possibility repair that in order. But just assume assume. I mean in that, at the specification level, right?

1:09:32
It for the case, where we assume that there is a repair path, a link to repair, but of course, with the prominent either protocol, you're going to have to pay attention to the occasion. Me may not even by just me just to simplify respect for the case. What there is a?

1:10:17
So Dr. Microsoft will actually understand the problem first And then start writing this multiplication. Basically, it's going to be a need these proposed, how an article of questions you we have. So, we have decided the Spanish tree. We have another information about a whole, the later world over here.

1:10:41
So we know that the day from those phone there in some collision to the other mode, not only one page because every note knows. So, So other questions?

1:11:17
The companies, okay, you're one. No, you know, before another episode of the knowledge of with your askings. Now I have the two notes So and they know that message is supposed to be funny. I guess for it's always probably the case where there is a famous test.

1:12:09
We're problem. He called it last commission show and that's why with some of broken. This is never know. My brain is always, we have three best men and I'll be without them assume that we can repair. We're gonna be over, you've got to create. So we're doing essentialized solution or is it.

1:13:00
So we don't have a global view of your quest for. So we are assuming our program is normally on each individual note address is no notes his name. Oh, and it's no once the same program or to the earth being like yeah. Staying I'm saying if we lose the estate here we just had a baby and yeah baby.

1:13:47
And see. So this isn't a problem one single. Yes. Probably one the specification in English, the first table post. So you need to come up with specific.

1:14:42
So remember that each of state is one in which and being brother state is not in which the trees reconstruct, the problem.

1:15:09
While you're working on the spectrum, can you remember what the problem says you need? We have a broken spanning tree, so that should be what to say. In logic prose. We have a reconstructed spanning tree. That's what you should be, what the same light.

1:15:33
All right.

1:15:48
That we can use first. Yeah.

1:16:27
Little skin, eating mine's better. Yes wants to take over obviously. Okay, so he said loss, he got the physio but I can tell you no more expect

1:16:57
And someone with that hand, you know what? Good advantage, I'm filters. Yeah, of course here. Also, in AAVID of logic, notation for past. Let's just only go so image to possibly. Okay, that is it. Yeah, definition of life about to have that. And then everywhere to me for all a team.

1:18:19
Yeah, yeah. When you find out about the place, the accidentally repaired, we're available right here. The difference, I think we're assuming of the exact period but like that's not in the graphics. Okay. What do we don't have? Yeah. What do you think that is working know, three months, somewhere else is how to find the two previous things?

1:19:08
Okay, so yeah, we have a massive broken tree and that's fantastic. Yeah.

1:19:21
Bring it after that craft. And then post air tree. I guess it's not roasted. Oh my god. It is not broken tree. It probably didn't see. Good post is not approaching on necess. Don't know. That's like, that's why I was concerned about like, how do we guarantee? Oh, anything.

1:19:52
And I think you also have to say and give me. So, and so, yeah. Is there a thing? Maybe that we have lodging that? Yeah. You can do what you need exists then. Well integrity. You find what you are there.

1:20:25
You know, if you want to write that launch anything here, that's the broken SSD. I think you have to represent English, right? Your specification pure English, these kind of properties. We have some bag that we need to find the time. Usually we haven't. No. Initially have you want to crack?

1:21:05
We need to make sure especially in our team. So introduce yourselves. If you are enabled and TBR train. Yeah, that's so. And the treat contains which place not ever and regularly in English. Four pictures precise. English that he's I think we're saying former watching an impressive, like cheese, our grass that's been upstairs and spelling, G lettering.

1:22:45
Sounds.

1:22:50
We needed it, you know?

1:23:03
So first, you just have to Spanish people. And there is reasons first because we never thought some IT represented edge in a major except for by Warner. Oh, yes, it is. So in this program, okay, I really want to. It's not interesting. Okay, we need to know you need and we knew it was going to be representing us choose anymore here.

1:24:02
But is on one here, not very oxygen here. That doesn't make any sense. Is not. So as you initially, okay I can go. My hand is really initially, it's okay. I mean, initially, gravity is also really hope that we are. Of course, the most problems maybe Marco Polo. Maybe you can bring any calculators out To be activators can do every morning.

1:26:36
Yeah, just find the pictures. Like where the hijo? The program is really happened.