Computer Science by Neural Lantern - Dailymotion

Neural Lantern

Watch the playlist Computer Science by Neural Lantern on Dailymotion

Transcript

00:00Okay, hey everybody! In this video I'm going to talk about logic gates. I'm

00:04going to show you AND, OR, XOR, and NOT. We're going to draw them in a diagram

00:10style and we're going to rig up a bunch against each other and see if we can

00:13figure out how they would process some input data into, you know, some logical

00:18output.

00:24Okay, so for starters let's just go over what the gates look like. If you don't

00:28know how these gates work, check my previous videos because I've explained

00:32them there. Here I'm just going to sort of try to draw them and make a little big

00:36a little circuit area that we can play with. Okay, so AND. Okay, you know what you

00:42want me to? I'll just do a quick recap. The AND gate just means that both bits have

00:48to be a 1 in order for a 1 to output. So if we do a 0 and a 0 and a 0 and a 1

00:55then only this one is going to end up being a 1. Everything else is going to be a 0. For

01:04the logical OR, it's going to be if we do 0, 0, 0, 1, 1, 0, and 1, 1. And if this is

01:10too fast and confusing for you, see my other videos. But basically it's going to be a 1

01:15for those three because if either of those bits are a 1 then the output is going to be a 1 and the

01:19only place it'll be a 0 is when both of the bits are a 0. Okay, so then let's look at XOR. So XOR is

01:26basically it's an OR except this one position right here where both bits are a 1 that would end up being a 0.

01:34So for XOR, 0, 0, 0, 1, 1, 0, 1, 1, it's going to be a 0 and then a 1 and then a 1 and then a 0. So it's just a little bit different from OR.

01:47And then NOT just inverts the bits. So we'll take one bit at a time and it's just a 0 becomes a 1 and a 1 becomes a 0.

01:56And that's pretty much it. Okay, so maybe I should put NOT right here just to just to emphasize that I'm talking about NOT.

02:03Okay, I'm definitely NOT NOT talking about NOT. Sorry. So let's do a, let's draw a logical or a bitwise AND gate.

02:14It's basically just kind of like this and then there's a little flat ridge at the end of it and it takes two inputs.

02:21There are many different styles to draw these kinds of gates, but I'm going to use the ANSI style I think for the most part.

02:27So just keep in mind, you know, you can draw these in many different ways.

02:31It's going to take two inputs. Imagine this is a little circuit right here and it's going to give you one output.

02:36So if you imagine what we talked about before, we could send it two different bits and it will produce the output for us.

02:43So if we give it a 0 and a 0, then it's going to output a 0 for us.

02:48If we give it a 0 and a 1, it's still going to output a 0.

02:52If we give it a 1 and a 0, still a 0.

02:56If we give it a 1 and a 1, then finally it'll actually give us a 1.

03:01Okay, so that's just the way that gate looks and now I'm going to draw the next one.

03:06Let's draw the OR. So maybe I'll put OR here.

03:09Whoops.

03:11Oh, I got to do that.

03:13OR.

03:14So the OR gate kind of looks like the AND gate, at least in the style that I'm drawing.

03:19Except the flat ridge is more curved like this.

03:23So, you know, an AND gate, I'll draw it in red just to remind you that this is not what we're doing right now.

03:27It's, you know, flat, right?

03:31Whereas the OR gate, it has a curve.

03:33It's like a crescent moon kind of.

03:35It still takes two inputs.

03:37So I'm going to do an input here and an input here.

03:40And it still has one output.

03:42And so if we're just going to give it a 0 and a 0, it's going to output 0 for us.

03:46If we give it a 0 and a 1, it's going to output a 1.

03:51If we give it a 1 and a 0, it'll still output a 1.

03:56If we give it a 1 and a 1, it'll still output a 1.

04:00Okay.

04:01That was pretty easy.

04:03Let's look at exclusive OR.

04:05So XOR.

04:06XOR.

04:07The XOR gate looks like the OR gate.

04:12So I'm going to start by trying to draw an OR gate as best I can, which is not good.

04:16Oh, God.

04:17Let me start over on that one.

04:19Let me try it one more time.

04:21And then I'll just give up.

04:22Okay.

04:23Do this.

04:24And then I'll say...

04:26Okay.

04:29That was good enough.

04:31And then it has another line right here.

04:33The line is supposed to be parallel to the crescent moon, you know, the curved side, but

04:38not really touching it.

04:39And that way it sort of looks like the inputs are passing through like the first line before

04:46they touch the actual ridge.

04:48So that's an exclusive OR.

04:50It also outputs one bit.

04:52So just practicing, we'll give it two zeros.

04:55It's going to output a zero because there's no OR involved in two zeros.

05:00I guess there's no ORness to the two zeros.

05:03If we give it a zero and a one, then that's going to output a one because exactly one input

05:08is a one.

05:10If we give it a one and a zero, same thing.

05:13Looks good because one input was a one.

05:16But then once we get to two inputs, then it's going to output a zero because the exclusive

05:22OR demands that only one of the bits is a one.

05:25And actually exactly one of the bits is a one to produce a one.

05:29Okay.

05:30So then the next thing that I can show you is a NOT gate.

05:32It's sort of like a little triangle here.

05:34And again, there are different drawing styles.

05:36It takes only one input.

05:38And then there's like a little circle up here on top and then it outputs at the top.

05:42And so if we give it a zero, it's going to output a one.

05:46I guess I could draw it a second time since there's only two things we can input to it.

05:52It's going to give us a zero if we inputted a one into it.

05:56So it just reverts.

05:57It's an inverter of bits of one bit.

06:01So I hope this helps you understand the basics of these types of gates.

06:06Now I'm going to try to make a bunch of them.

06:08See if I can come up with something interesting on the fly.

06:11I had problems with the drawing system on my other computer.

06:14So I didn't really prepare an example.

06:16Hopefully this is good.

06:17You never know.

06:18I'm just going to draw an AND gate here.

06:22And I'll say that it takes two inputs because that's what it does.

06:25And then right next to it, maybe I'll do an exclusive OR.

06:28So I'll do like an OR gate here.

06:33And then I'll do the exclusive OR part of it.

06:37And I'll give it two inputs because that's what they take.

06:39And then next to that, maybe I'll just do a regular OR.

06:43We'll say OR just like that.

06:46Oh, that's awful.

06:47Try one more time.

06:48I'll just do this and then say this.

06:53Okay.

06:54That's acceptable sort of.

06:55We'll do two more inputs there.

06:57And what else can I do?

07:00Should I do another exclusive OR or an AND?

07:03What do you think?

07:04Vote.

07:05Just kidding.

07:06I'm going to do an AND right here.

07:09So I'm kind of repeating one of the gates.

07:12Let's see.

07:13AND OR X OR.

07:15Yeah, that's all I wanted to talk about.

07:16Okay.

07:17So now we can combine them because remember these have an output.

07:20But if we sort of use the outputs of two of the gates as input for another gate,

07:27then we can sort of like chain our circuits to make something a little bit more interesting.

07:34So maybe here I'll do an AND.

07:36I'll say this is an AND gate.

07:38Oh God.

07:39That's awful.

07:40One more time.

07:41Okay.

07:42Yeah.

07:43My text to speech engine who I've given the personality of Mary Poppins is telling me

07:49that a door is open.

07:51So I've got to close the door after this video.

07:56Anyway.

07:57Yeah, I have like an LLM server in the other room.

08:01And so now my home assistant is a little bit smarter.

08:04And sometimes she messes with me.

08:05That's a story for another video.

08:07Okay.

08:08So I'm combining the output of both of those gates and sticking them into an AND.

08:13And then I can do the same thing here.

08:15I think I drew those.

08:16I think I drew it like way too high.

08:17I'm going to run out of room.

08:18Let me try one more time.

08:20Put that there.

08:22We'll do an AND gate.

08:24Like that.

08:25And then I'll just maybe curve the wires.

08:28So it seems like it makes more sense.

08:31Okay.

08:32And then maybe over here I'll do a, I don't know.

08:36Maybe this should be an OR.

08:37I'll do an OR gate.

08:39Like that.

08:40And then the inputs from the other ones go into the OR gate.

08:44Then these two can combine to one more.

08:50So maybe I'll do exclusive OR.

08:52I guess.

08:53I'll just put an OR gate here.

08:57And then I will.

08:59That's not, that's not curvy enough, is it?

09:02I like my, my, I like my, I like my XOR gates nice and curvy.

09:07So we'll do this.

09:08And then I'll put another line under it.

09:11And then we'll connect these two.

09:14So we'll do this.

09:17Okay.

09:18So then finally we have like one bit that's going to come out at the top.

09:21Let's use the NOT gate.

09:22Might as well.

09:23So I'm going to connect this to a NOT gate and put a little circle on top of it.

09:29And then it will give us our final output.

09:31And maybe I'll stick it here in green or something like that.

09:34Okay.

09:35So there's lots of different input output combinations we could use.

09:38Let's see for every input we have, that's one bit.

09:41So one, two, three, four, five, six, seven, eight.

09:43That's eight bits.

09:44That means I could draw out 256 possible input combinations,

09:50which I'm definitely not going to do in this video, but let's just do some random stuff.

09:55Let's start off with zeros just for fun.

09:58So we'll do a bunch of zeros here.

10:00So if you sort of look at this diagram, we go, all right, what was that?

10:06Uh, this AND here, there's two zeros.

10:08It's going to produce a one.

10:09So I'm just going to put a one right here to remind me that a one is going to be the output of that gate.

10:14And then the OR gate here is going to also output a, what am I doing?

10:19Why did I put a one?

10:20A zero because zero and zero is zero.

10:23And then zero OR zero is also zero.

10:26So this is going to output a zero.

10:28And then this exclusive OR is also going to output a zero.

10:30And then the AND is zero.

10:32So I just have zeros at the next level.

10:34Then we look at the inputs here to this AND.

10:36That's obviously going to be a zero.

10:38And then we look at the OR here.

10:39That's obviously going to be a zero.

10:40And then those two go into the gate.

10:43That's a little bit higher.

10:44And it's going to output a zero because exclusive OR needs at least, you know, it needs exactly one, uh, one.

10:50So it kind of feels like it's going to be a zero for the output, right?

10:53Uh, you'd be wrong if you thought that because the knot is going to invert it.

10:56The knot is going to take that zero and flip it to a one.

10:59So if we do all zeros, the answer is actually going to be a one.

11:03Okay.

11:04Let's reset this and try again.

11:07So I'm going to just get rid of these greens here.

11:13And then I'm going to do, maybe I should write the inputs in red.

11:16So they're more fun.

11:17So they don't feel like they're blending too much in with the actual diagram.

11:22Okay.

11:23So, uh, now I'm going to make, let's try all ones.

11:25Let's see what happens if we do all ones.

11:27So I'm going to do ones on every input.

11:29One, one, one, one, one, one, one, one.

11:32And so, uh, if we look at this and gate, it's going to output a one because,

11:37well, a one and one is a one.

11:40Uh, the or gate, same thing because a one or one is a one.

11:44And then do the same thing down here for this and,

11:46and then the exclusive or that's going to be a zero because it wants exactly one bit to be a one, not both.

11:52So it's a little bit more interesting.

11:54And then we go up one level.

11:56This and gate is going to output a zero because it wanted both of those inputs to be a one for it to output.

12:01For it to output a one.

12:02And then for the or, it's also going to output a, well, it's going to output a one again,

12:06because both of those are ones.

12:08And then if we look at the exclusive or, oh, that's going to output a one this time,

12:12because exactly one of the inputs is a one.

12:16Then the not is going to invert it.

12:18So the final answer is going to be zero for this whole giant thing.

12:21I want to say make sense and wait for questions, but I guess I can't.

12:27So let's try another example.

12:29I'm going to do maybe two examples with totally random numbers.

12:32And then I'm going to show you how to write a truth table that might help you work this out on paper

12:37or like a, like a notepad if you don't really want to draw.

12:40So let's see.

12:42Um, I guess I'm going to like, maybe take some of these and turn these into zeros.

12:49Let's see, get rid of that.

12:51Make that a zero.

12:52Maybe like, I don't know.

12:54I don't know.

12:56I feel like I'm not random enough.

12:58Okay.

12:59One, zero.

13:00And then like, maybe like a zero here.

13:03How about like a one there and a zero there?

13:05Just one, zero, one, zero, oh, one, oh, one.

13:07That's too much of a pattern.

13:08Let me do, let me do a one, oh here or a one and a one.

13:11Okay.

13:13That feels more random to me.

13:15So looking at the and gate, that's going to output a zero.

13:18The or gate is going to output a one.

13:20The exclusive or is going to output a zero.

13:22The and is going to output a zero.

13:23So we just got a one right there.

13:25So this and is going to output a zero again.

13:27This or is going to output a one.

13:29And then the exclusive or it's got enough to output a one.

13:32So that's nice.

13:33And then it's final output is going to be a zero because we had to not that one.

13:39Nice.

13:40Okay.

13:41Let's just, I don't know, change a couple of random bits.

13:42I'm going to change this.

13:44Well, let me erase first.

13:46And then I'm going to start changing random bits.

13:49I don't even remember what that last bit was anymore.

13:52I'm going to pretend it was a one.

13:54And then I'm going to change it to a zero.

13:56And then I'm going to change this zero to a one.

13:58Then maybe I'll change this one to a zero.

14:01And then I'll change this, this zero to a one.

14:04Not like exactly random.

14:05It's human random sort of.

14:08So let's look at this.

14:09The and is going to output a one.

14:11And the exclusive or is going to do a one.

14:14And then the or is going to do a one.

14:17And then the and is going to do zero.

14:19Hmm.

14:20One and a one.

14:21Zero and a one.

14:22One and a one.

14:23Zero and a one.

14:24One and a one.

14:25Zero.

14:26Okay.

14:27I think I did it right.

14:28So the or is going to do a one and then I think what's happening is I got to adjust my penmanship style.

14:35I still have to like lift up sooner so it doesn't change colors.

14:39So then the and it's going to output a one.

14:42And then this exclusive or it's going to output a zero because it wants only one bit, one input to be a one.

14:49And then the not is going to invert it.

14:51So now we have a one right there.

14:55Okay.

14:56Let's look at the idea of using a truth table to make this a little bit easier to solve if you're just kind of doing this without drawing.

15:02So I'm not going to clear this just yet.

15:04I might have to clear it in a second.

15:05But the first thing that you should do when you're making a truth table is, you know, I mean, I guess you can style this however you want.

15:13But you kind of have to think of this hierarchically.

15:16Like what's the easiest thing to do?

15:18You don't want to start computing the thing at the very top because that depends on a lot of other stuff that's at the bottom.

15:23So instead, I'm going to look at the very bottom row of inputs because they're the easiest to calculate.

15:28So I'm going to do and I'm going to say something and something.

15:42I guess I'm just going to put and by itself.

15:44Maybe I'll put one for input.

15:46So for the inputs, I'll just do the bits here.

15:48One, one.

15:53Zero, one.

15:55One.

15:56No.

15:57Okay.

15:58Let's just use two inputs only because we're looking at the lowest level here.

16:03Yeah.

16:04And we'll make maybe like a separate row or a separate table for that.

16:07So we just have two inputs per gate on the bottom row.

16:10And so for the end, it's going to be a one.

16:13Right.

16:14Right.

16:15Then for the zero, one.

16:17Well, maybe I should just do this in numeric order.

16:21I'll just do every possible combo because we don't have that many numbers.

16:24So we have four combos.

16:26This is like zero, one, two, three.

16:30So from zero to three or four possible combos.

16:33And then the end is going to be a zero here and a zero there and a zero there.

16:38So that's a truth table that just handles that first gate.

16:41So then I'm just going to, you know, right.

16:45I mean, you could make another truth table for this, but I'm going to try to write this

16:48in a more compact way.

16:50I'm going to say the second column is the result of ending.

16:53The next column is the result of oring.

16:55And then the last column is the result of, uh,

16:59maybe second to last as a result of an X or, and then maybe I'll make another table for nodding.

17:05So what is the result of an or here?

17:07It's going to be a, whoops, a zero.

17:09Uh, the or here is going to be a one.

17:11The or here is going to be a one.

17:12The or here is going to be a one.

17:13So when you start to make these tables,

17:15it just makes it a little bit easier to, uh, to work your way up

17:18because when it gets time to let's say the not,

17:20you don't have to compute all the other things

17:22because they're already computed in the table.

17:25So we got the, uh, or, which I should have probably done first

17:29because the second gate was an X or.

17:32I should have done that maybe third.

17:33I don't know.

17:34I'm going to leave it as and and or right now.

17:35And then we're going to do X or.

17:37So X or is basically if exactly one bit is a one will output a one.

17:44So that's a one there and then a one there and then a zero there.

17:49Okay.

17:50So we've got the basics.

17:51And if you think about it, that's the whole bottom row, right?

17:54So if we're just sort of looking at, let's say the, uh, the third gate right here,

17:58then, uh, we just have to look at input one, one for the or.

18:01And then that's this right here, right there.

18:06So that tells us what the answer would be truth table.

18:09And then if we're looking at the X or for input zero one, we just have to go.

18:13All right.

18:14Zero one X or the output should be a one and we can double check ourselves

18:17because it's really, really easy to make mistakes.

18:19I'm sure there's a chance that I have or will make a mistake pretty soon.

18:23Um, so we did and or an X or let's do maybe just one for the not just to remind ourselves

18:31of what it is.

18:33Uh, and I'll just say not.

18:35And so we can only do two different inputs on the, uh, on the not.

18:39So I'm going to go maybe a zero and then a one right here.

18:43And then the not is going to say, we have a one there and a zero there.

18:46Okay.

18:47So now we can get a little bit more complicated by combining these terms.

18:52So for the input, now we could do, we could do, uh, let's say two gates at a time.

19:01So we'll do the input here and we'll say the input is going to be one one zero one.

19:08And so when we not, when we not the, uh, well, when we do an end for the one, one,

19:20we can end up with a one.

19:24And then when we do an X or on the zero one, then this is not the best truth table.

19:32To be honest, there are better ways of writing this, but I'm just trying to, I'm just trying

19:36to do it.

19:37Uh, the X or, uh, is going to be a one.

19:39Uh, is going to be a one.

19:40So now we kind of have the results written down here.

19:43Let's do another little table.

19:47And you know, the way these tables work is, um, you, you kind of want to put every possible

19:51combination of inputs there, but that alone is going to be so many combinations.

19:55I don't want to write it all down.

19:57And by the time we get to eight bits, it's going to be like in the two hundreds.

20:00So if we just look at the next pair of, uh, gates, we'll say one one zero zero.

20:06And the first thing is an or for the one one.

20:11And then the next thing is an end for the zero zero.

20:15And so I can just write this down and go, all right, the, or is going to be a one and

20:20the end is going to be a zero.

20:22Okay.

20:23So then I can do another level.

20:25I've pretty much just handled, you know, the bottom row here.

20:28And again, each table is supposed to be filled out for every possible combination of inputs,

20:33but I can now just kind of move on to the next row.

20:35I can say, what is the result of inputting a one and a one?

20:42You could do that, but it might be a little bit better and closer to some other places

20:46that might want you to input this sort of thing to write down what is the result of the,

20:51or what is the, what are the two gates that are giving you that input?

20:54So if we say, um, uh, okay.

20:59So the first input on the very bottom left, that's an end, right?

21:03And then the next input on the bottom row is an X or.

21:06And if we're trying to figure out, you know, how are we combining those?

21:10We could say, uh, and, and X or, or we can do, you know, two ampersands.

21:16Um, I guess I'm going to do.

21:19And, and X or just to keep it in plain English as much as I possibly can.

21:25So basically, uh, this is going to have, you know, one result, you know, one bit result.

21:30And it's input is going to be, uh, one, one zero one.

21:36And so maybe I should do another row here.

21:39We can say the end, uh, for the end is going to, for one, one is going to be that.

21:48And the X or is going to, well, I already wrote that down in the table.

21:51Okay.

21:52I'm just going to, I'm just going to clean it up because you know, it's really good in

21:55these truth tables.

21:56If you write down all of the numbers, but I'm just going to do it.

22:00This, I'm just going to do it.

22:01This maybe, maybe we can visually see that there's a one, one going into the first end

22:06and then a zero one going into the second, uh, gate, which is an X or I think maybe that's

22:11acceptable.

22:12So the result of that, if we just sort of look up at this table here, we have, you know, what

22:18is the end and what is the, or it's a one and a one.

22:21So if we end those two together, that should be a one.

22:25So that means if we, uh, and the end against an X or, then that's the result that we get.

22:30And then, uh, we'll make another little table here for the next layer of inputs.

22:36So I'll just do this and I'll say, or, and then the operator that combines them is an

22:47or, and then on the right side, it's an and.

22:50So then the input to both of those is going to be a one, one, zero, zero.

22:56And again, you should make another row for every possible combination of inputs.

23:00That would be a really smart idea.

23:02So then I will say that, uh, the or in the end for a one, one and a zero, zero is this,

23:11because we already wrote that down in the truth table.

23:13So really we're going to be looking at inputs of one and zero.

23:16So that means, uh, if we're applying an or to that, the final result should actually be one.

23:22Okay.

23:23So now we've got, uh, that's that second row.

23:30We just have to look at the, uh, the second to the last row.

23:33So I'm going to go input for, um, an X or of something else.

23:41And the X or is going to be, oh gosh, it's going to be of an and, well, X or let's put that in the middle.

23:54Let's say, and on the left and, or on the right, and then we'll do an X or against them.

24:03Hmm.

24:04Maybe you could put the parentheses on the other ones.

24:05I don't know.

24:06I'm struggling with notation clearly right now, but, uh, so we say, and exclusive or with the or, but then what is that and happening?

24:15Let's put some more parentheses around it.

24:17And we'll say the and ended with an X or now we're running out of room here.

24:27Can I get this like at the top, maybe more?

24:30How about that?

24:31Okay. That's a little bit better.

24:32So we have, and, uh, being ended against an X or, and then I put parentheses around that.

24:38There is a, there are special symbols you can use for this to make it more clear, but I'm not really trying to explain that right now.

24:46So I just want you to see how the gates work.

24:49So we have, uh, then the next two operators are in, oh gosh.

24:55Yeah.

24:56We're X oring against two things.

24:58So on the right side, the or is oring and or, and then on its right side is the end.

25:04So maybe I should do, I don't know.

25:08I guess I'll put parentheses right there to make it seem a little bit more clear.

25:11So now we've basically got an X or and on its left side, what's happening underneath it is an ending, which is the middle of an and on the left and an X or on the right.

25:22And then the, uh, the right side of the X or is then the, uh, the right side of the X or that was my L I'm talking to me again.

25:36The right side of the X or is, uh, it's got an or on its left.

25:40Sorry.

25:41It's oring on its, on its right.

25:43And then under the or it's got an or on the left and an and on the right.

25:46Okay.

25:47So we've written all these down in a way.

25:50That's okay.

25:51Not great, but okay.

25:52And I'm just going to do one, one, zero, one, one, one, zero, zero.

25:58And then, um, I'll make another video in the future about truth tables.

26:03If everyone is super interested, but that's, that's not really what I need to explain right now.

26:06I'll make a video where the truth tables look proper and nice and full and all that stuff.

26:11So let's do, what is the answer between the, oh, I have to scroll up a little bit to see that.

26:18So the left side of the X or had an ending of an and an X or.

26:23So that was this right here.

26:25So the result of that was a one.

26:28And then the right side was an or ring of an or and an end.

26:36And that was a one.

26:37So I have two ones basically.

26:39So this X or is going to output a zero because it's, it's got two ones as an input or as inputs.

26:48Okay.

26:49So then I guess I could copy paste this to make it a little bit easier on myself to write it all out.

26:55And I could just say, let's not the whole entire thing to get to that highest level.

27:01So I, you know, again, I can just kind of keep the whole thing, copy pasted.

27:06And you know, the original input bit sequence, I can just nod it.

27:10I can just change that zero to a one.

27:12So let's just double check all our levels here to make sure that I did this correctly.

27:15You never know.

27:16I never know.

27:17So the input not, we know what that is for the end and the X or where's the end and the X or.

27:23Okay.

27:24So bottom left.

27:25Oh, what did I do wrong?

27:29Input.

27:30Oh, that was, those were just the basics.

27:31Okay.

27:32So that's not a combination.

27:33Let me just double check the basics for the ending.

27:35The ending zero and zero and zero and then zero and then one and then one.

27:43And then here it should be a one.

27:44And then the or should be one.

27:45And it should be a zero.

27:46And here the end should be a one and the or should be a one.

27:48And the X.

27:49Okay.

27:50So I got the basics, right?

27:51And then online 15 here, we're looking at, um, and, and an X or, I just, I guess I just

28:03did, uh, both of those at the same time.

28:05Okay.

28:06So the end is a one and the X or is a one.

28:08And then the next one, the or in the end, it's a one and a zero.

28:12Okay.

28:13And then the, we're ending the end in the X or.

28:18So that's a one, one, zero, one.

28:20The answer should be a one that matches the diagram.

28:23Okay.

28:24And then the, uh, or ring of the or in the end on the right side, that's a one.

28:29So that matches the diagram.

28:31And then, uh, when we're doing the whole thing, except for the knot, it should be a

28:35zero at the top.

28:36Okay.

28:37Good.

28:38And then finally, when we invert it at the very top, it's a one.

28:40So keep that in mind.

28:42You can build and build and build in a hierarchical manner.

28:45I mean, think if I started adding a bunch more stuff on top of this knot, maybe if there

28:50were a bunch of other circuits somewhere else and they were combining and combining like

28:54many layers.

28:55Uh, this is the sort of thing that could help you.

28:57A drawing I think is a little bit easier, but this could help you to just draw out a

29:01little table.

29:02Um, and of course you want to have a giant table showing all combinations somewhere, uh,

29:07just to make sure that you can just look it up quickly.

29:09But, um, but yeah.

29:12Okay.

29:13I think this is all I wanted to talk about.

29:14Let me just double check.

29:15All right.

29:16So this is all I wanted to talk about for this video, uh, about logical gates and the basics

29:22and kind of helping yourself with a little bit of a table in future videos.

29:25I'll talk about a proper table perhaps.

29:28And I hope you've learned a little bit and laughed a little bit at me struggling to do this

29:33on the fly without a pre-made example.

29:35And I hope you, uh, had a little bit of fun and learn a little bit of stuff and I'll see

29:39you in the next video.

29:40Thanks for watching.

29:41Hey everybody.

29:42Thanks for watching this video again from the bottom of my heart.

29:47I really appreciate it.

29:48I do hope you did learn something and have some fun.

29:51Uh, if you could do me a please, a small little favor, could you please subscribe and follow

29:57this channel or these videos or whatever it is you do on the current social media website

30:02that you're looking at right now.

30:03Um, it would really mean the world to me and it'll help make more videos and grow this community.

30:08So we'll be able to do more videos, longer videos, better videos, or just I'll be able

30:12to keep making videos in general.

30:14So please do, do me a kindness and, uh, and subscribe.

30:18You know, sometimes I'm sleeping in the middle of the night and I just wake up because I know

30:22somebody subscribed or followed.

30:23It just wakes me up and I get filled with joy.

30:25That's exactly what happens every single time.

30:27So you could do it as a nice favor to me or you could, you could troll me if you want

30:31to just wake me up in the middle of the night, just subscribe and then I'll, I'll just wake up.

30:35Uh, I promise that's what will happen.

30:37Also, uh, if you look at the middle of the screen right now, you should see a QR code,

30:41which you can scan in order to go to the website, which I think is also named somewhere

30:45at the bottom of this video.

30:47And it'll take you to my main website where you can just kind of like see all the videos

30:51I published and the services and tutorials and things that I offer and all that good stuff.

30:55And, uh, if you have a suggestion for, uh, uh, clarifications or errata or just future videos

31:04that you want to see, please leave a comment.

31:06Or if you just want to say, Hey, what's up?

31:07What's going on?

31:08You know, just send me a comment, whatever.

31:10I also wake up for those in the middle of the night.

31:12I get, I wake up in a cold sweat and I'm like, it would really, it really mean the world to

31:17me.

31:18I would really appreciate it.

31:19So again, thank you so much for watching this video and, um, enjoy the cool music as,

31:26as, as I fade into the darkness, which is coming for us all.

32:26Bye.

32:27Bye.

32:56Bye.

33:26Bye.

33:56Bye.

34:26Bye.

34:27Bye.

Logic Gates Crash Course: Learn AND, OR, XOR, NOT & Build Circuits

Category

Transcript

Computer Science

Recommended