And since you know that any computing device uses these logic gates, at the end of the day you can literally create something like a mobile phone using literally ANYTHING, you just have to create some kind of logic with it that represents these logic gates and you are ready - just how it was represented in this video using dominos. Because of this logic - you are able to read this comment reply. Blows my mind every time.
Great video! The only thing missing here is the Not gate. This is a possible implementation that I thought about: We can achieve negation of a bit by Xoring it with 1 (0 Xor 1 = 1, 1 Xor 1 = 0 ). So, we can add to the circuit a line of dominos, which will be pushed at the beginning of the calculation, that represents the constant 1, and every time we want to use a Not gate, we can use a branch of this line as an input for a Xor gate, with the other input being the bit we want to negate.
The NOT gate is simple, it has one "energy" input which is a direct path to the output and one domino input that interferes with the "energy" path if the input is 1
Logical solution but expensive (dedicated bit) and cumbersome (timing and placement of them in addition to the regular bits). Still, good thinking, i don't think there's another way!
@@VianneyOuiBon i don't think there's another way either, but i think that is the best way. the main problem with domino logic is the fact that a "1" is non-reversible, so not gates without a timing pulse and flip flops without an extra "lift up" move will be impossible.
There is one problem with this. In order to make fully Turing complete system, you would need a NOT gate, which is Kind of problematic. Even not thinking how to make it, any gate that would Output 1 when there is no Input, would fire instantly, due to signal not reaching it yet. What I propose, is a new clock path, which is toppled at the Start to the program, and has precisely such length, that it joins any currently firing gate, for gâtés which output 0 without inputs, thé clock signal isn't needed, but for example not gate would fire only when the clock signal reaches it. And in this way, not gate would simply be XOR between Input, and clock signal. Outputing 1 when clock gets to it, but no Input is in, and 0 when either there is both Input and clock, or when there is no clock or Input. There would be 1 if there is Input and no clock, but this can be solved by just changing thé length of some paths.
It could never be Turing-complete as you would eventually run out of dominoes. But if you are fine with finite computations, a pseudo not gate can be a line which after some period of time is cut off. I believe this was demonstrated in Matt Parker's water computer video.
just make an XOR gate but treat one of the inputs as a clock, so that it is always on. Now if the input that you are using as your input is 1, the output is 0, but if the input is 0, then the output is 1.
Interesting point! But I think the not-gate isnt the problem here. You can simulate a not-gate out of XOR-gates. I think the real problem here is that you: 1. can't simulate storage 2. can only simulate a finite number of states Because of the missing storage and the finite number of states, my guess is, that the system is equivalent to a DFA, and can only solve problems that are expressible on regular Type-3-languages of the chompsky hierachy. What do you think?
the idea at 6:39 is what a computer clock does. every calculation in a computer is given a clock cycle amount, and the CPU knows to wait that long to continue to the next operation in order to correctly calculate its result. You could time based on # of dominoes and create your dominoe clock :) interesting perspective
Amazing vid to allow someone not savvy in this to understand it pretty easily! I feel ready to take on Minecraft Redstone, and I am also excited to see someone make a Domino chain run doom :)
😄 😄 must be about the most creative thing I've seen on youtube. On a technical note, the way he avoided a NOT-gate, thus any need for a ‘constanr supply’, in order to create a XOR straight is highly impressive. 👍👍
I have a Question: I'm studying computer science and I wonder if your system is really capable of calculating "any computation you'd like", like you said at the beginning of the video. Since you can only hit a domino-row one time, (it doesn't stand up by itself) you are not able to implement a while-program, where you don't know the number of execution-steps in the first place. You can only implement loop-programs, where the number of iterations is known at the beginning. Loop-programs are less powerful than while-programs. While-programs are equivalent to a turing machine, loop-programs are not. In other words: this system can't be turing-complete. So you are only capable of solving some loop-calculatable problems. (or all?) My guess is that your system is equivalent to a one-directional turing-machine, and so it would be equivalent to a deterministic finite automata (DFA). If so, you could only perform operations on regular languages (Type-3 Chompsky). On lower languages you would have to implement some kind of reusable storage-system.. What do you think? Your video was amazing btw. I love to see how people always come with new, creative ideas to explain the concepts of computersciene!
I think it is even less than an dea (DFA) (deterministischer endlicher Automat), as an dea can accept the regular expression (10)*, which I don't think, is possible with dominos
*OMG, That was an amazing explanation, clearly something out of the box Mr. Brian. I am following you all the way from CS50 😁👏🤩 and now I am your 500th subscriber waiting for more videos like this. Love from India* 💕🙌12-Aug-2020.*
If you’re curious, there is such a thing as “domino logic” in digital logic design!! It starts with assuming the output is a 1, and will discharge the output to a 0 if the gate needs it. This change can cause more gates to fall from 1 to 0, and so on, hence “domino”, and is used because it is significantly faster than traditional (CMOS) circuits
You can't build a computer if you can only use each gate once. You can't feed your input with the last input so you can only build combinational logic but not sequential logic and therefore no computer. Also you can't build flipflops.
This is a cool way to conceptualize the logic. However, the dominoes would be hard to take past adders because they are timing-reliant, some of your circuits feed back through the inputs which can be a problem, and, of course, you can't reuse circuits.
It's satisfying and clever. Also, have you noticed that the OR gate inputs provide twice the kinetic energy when activated simultaneously? That means third logical level can be implemented.
the worst thing about this is that you can not have a clock, and use the same row of dominos to run current again, but this was such an interesting video, it was really fun to see designs for different gates.
Well,we can only imagine circuits with Dominos,where inputs are fixed. If the inputs changes then you have to manually put together the Dominos again for it to work as depicted. Hence you can't imagine sequential logic, fsm,Controllers or calculate logic operations for sequence of data nor memory operations. Hence even hypothetically,you can't make a simple Turing machine with this concept. However it's a good depiction of computer logics for high-school students.
This is literally how Windows works - also the irony is not lost on me that a significant amount of computing was required to simulate the domino’s to make a basic computer
I can visualize miles of plates, each with a different circuit of hinged dominoes on it. They get started by punch cards and punch cards using weighted spiked dominoes at the end. And the whole thing resets all dominoes every clock cycle. Like an IRL Minecraft computer.
okay, now that you got the design, get one of those domino clubs to build a calculator, ask the guiness world record team for an arbitrary input, then calculate that task using real dominoes.
very cool! the only downside is that it is hard to un-fall a domino
Are you sure about that?
th-cam.com/video/IQhgiL3TqYQ/w-d-xo.html
But we can make it in a 3d sumulation when we just have to click 'regenerate'
@@donut_Boi8 but that will be against the laws of dominos.
figure out how to perform telekinesis and its as easy as that.
@@donut_Boi8 Have a domino hit a tiny see-saw made of dominoes to fix a different domino, simple 👌
Time to make a working operating system with dominoes
Might take quite a lot of dominos!
@@SpanningTree I have the time. Quarantine won't end anytime soon so...
let's count Domino's Pizza with Domino
well, clocking woulnd work i guess
@@SpanningTree 😂😂😂
One of the most interesting takes on logic/computing i've seen. I've never thought of domino as programming. Awesome.
10000 Domino computer. Built and did two calculations. But yes this video explains the design best thoroughly
See the one with water and gears too by Steve mould
Because you are noob
@pyropulse you took a cool video and ruined it, i hate you.
@pyropulse bro let the intrusive thoughts win
As someone who studied electronics I find it fascinating how you can make and, or, nor, xor, etc. with so many different things and not just circuits.
And since you know that any computing device uses these logic gates, at the end of the day you can literally create something like a mobile phone using literally ANYTHING, you just have to create some kind of logic with it that represents these logic gates and you are ready - just how it was represented in this video using dominos.
Because of this logic - you are able to read this comment reply. Blows my mind every time.
@@ScorpioN-mm5pd Yup! And that's why I love this so much
Ikr. they even made logic gates using bacteria 🤷🏻♂️
@@integraxnine745 They've done it with Magic The Gathering playing cards...
ikr its just like the logic itself is real or something
“Have you tried turning it off and back on again.”
“Hold on let me try that real quick.” **starts stacking dominos for 10 hours**
Great video!
The only thing missing here is the Not gate. This is a possible implementation that I thought about:
We can achieve negation of a bit by Xoring it with 1 (0 Xor 1 = 1, 1 Xor 1 = 0 ). So, we can add to the circuit a line of dominos, which will be pushed at the beginning of the calculation, that represents the constant 1, and every time we want to use a Not gate, we can use a branch of this line as an input for a Xor gate, with the other input being the bit we want to negate.
but all gates needs their inputs to be triggerd at the exact same time, so you have to add a delay to each NOT gate.
The NOT gate is simple, it has one "energy" input which is a direct path to the output and one domino input that interferes with the "energy" path if the input is 1
Logical solution but expensive (dedicated bit) and cumbersome (timing and placement of them in addition to the regular bits). Still, good thinking, i don't think there's another way!
Just have a really long chain of dominos that starts from off-screen and the not-gate moves one of them out if the input is 1 lololo
@@VianneyOuiBon i don't think there's another way either, but i think that is the best way. the main problem with domino logic is the fact that a "1" is non-reversible, so not gates without a timing pulse and flip flops without an extra "lift up" move will be impossible.
This is FANTASTIC. Makes one see how information is truly substrate independent
This concept should be taught to children as a foundation to show how computers work. Kudos to you Sir.
There is one problem with this. In order to make fully Turing complete system, you would need a NOT gate, which is Kind of problematic. Even not thinking how to make it, any gate that would Output 1 when there is no Input, would fire instantly, due to signal not reaching it yet. What I propose, is a new clock path, which is toppled at the Start to the program, and has precisely such length, that it joins any currently firing gate, for gâtés which output 0 without inputs, thé clock signal isn't needed, but for example not gate would fire only when the clock signal reaches it. And in this way, not gate would simply be XOR between Input, and clock signal. Outputing 1 when clock gets to it, but no Input is in, and 0 when either there is both Input and clock, or when there is no clock or Input. There would be 1 if there is Input and no clock, but this can be solved by just changing thé length of some paths.
Is it even a clock if it can't tick a second time?
It could never be Turing-complete as you would eventually run out of dominoes. But if you are fine with finite computations, a pseudo not gate can be a line which after some period of time is cut off. I believe this was demonstrated in Matt Parker's water computer video.
Pretty sure loops would violate physics if you have a finite amount of dominos.
just make an XOR gate but treat one of the inputs as a clock, so that it is always on. Now if the input that you are using as your input is 1, the output is 0, but if the input is 0, then the output is 1.
Interesting point! But I think the not-gate isnt the problem here. You can simulate a not-gate out of XOR-gates.
I think the real problem here is that you:
1. can't simulate storage
2. can only simulate a finite number of states
Because of the missing storage and the finite number of states, my guess is, that the system is equivalent to a DFA, and can only solve problems that are expressible on regular Type-3-languages of the chompsky hierachy. What do you think?
The explanation is amazing and this is even better than crash course computer science!
Can't wait for WinDominoes 11! Keep up the good work!
the idea at 6:39 is what a computer clock does. every calculation in a computer is given a clock cycle amount, and the CPU knows to wait that long to continue to the next operation in order to correctly calculate its result. You could time based on # of dominoes and create your dominoe clock :) interesting perspective
Imagine how many dominos it would take to render a 3D animation?
How many dominos would it take to render a dominos animation
@@theworm71561, 2 if you want them to topple each other.
the real question is : "What time it take for calculate the render a 3D animation". Sorry for my english, i'm french and bad in english.
@@dragon_-gu1dx faster dominoes would be nice.
at least 1
I really like how this is explained. Makes the base concepts way easier to understand.
oh boy i can watch these animations for days
THIS IS THE BEST VISUAL REPRESENTATION OF COMPUTER LOGIC I'VE EVER SEEN
Bro Mathed so hard he made a computer out of gravity
I never thought I see they day when Dominos were turning complete!
How did you make this animation? It looks amazing
Coded it in dominoes
This is the best TH-cam video on computer logic that I have ever seen.
Amazing vid to allow someone not savvy in this to understand it pretty easily! I feel ready to take on Minecraft Redstone, and I am also excited to see someone make a Domino chain run doom :)
This taught me more about computers, gates, and addition than videos dedicated to this topic.
Wow great analogy and visualizations, love the idea and makes it so much less abstract
This is one hell of a way to put it. I’ve never managed to understand logic gates until i watched this amazing video. Thank you.
It would be really interesting to see attempts to find the minimal dominoes needed to make each gate. I may be pulling my "computer" out lol
reminds me of the sleepless night I spent trying to make smallest gates in modded minecraft
this is hell..
Keeping in mind the failure rate may increase
😄 😄 must be about the most creative thing I've seen on youtube. On a technical note, the way he avoided a NOT-gate, thus any need for a ‘constanr supply’, in order to create a XOR straight is highly impressive. 👍👍
Just found you you seem like a very underrated channel in terms of views/subscribers
The time and patience you took to put this up if commendable! A big salute!😮
As a computer programmer, this was very interesting (and satisfying) to watch. I'd never thought about it like this before.
The algorithm never fails to bring me things I didn't even know I wanted to watch. This was great!
I have a Question:
I'm studying computer science and I wonder if your system is really capable of calculating "any computation you'd like", like you said at the beginning of the video.
Since you can only hit a domino-row one time, (it doesn't stand up by itself) you are not able to implement a while-program, where you don't know the number of execution-steps in the first place. You can only implement loop-programs, where the number of iterations is known at the beginning. Loop-programs are less powerful than while-programs. While-programs are equivalent to a turing machine, loop-programs are not. In other words: this system can't be turing-complete.
So you are only capable of solving some loop-calculatable problems. (or all?)
My guess is that your system is equivalent to a one-directional turing-machine, and so it would be equivalent to a deterministic finite automata (DFA). If so, you could only perform operations on regular languages (Type-3 Chompsky). On lower languages you would have to implement some kind of reusable storage-system..
What do you think?
Your video was amazing btw. I love to see how people always come with new, creative ideas to explain the concepts of computersciene!
we just need some kiddo to keep setting up the dominoes
child labor is the key
I think it is even less than an dea (DFA) (deterministischer endlicher Automat), as an dea can accept the regular expression (10)*, which I don't think, is possible with dominos
The most undervalued TH-cam video ever
*OMG, That was an amazing explanation, clearly something out of the box Mr. Brian. I am following you all the way from CS50 😁👏🤩 and now I am your 500th subscriber waiting for more videos like this. Love from India* 💕🙌12-Aug-2020.*
Glad you enjoyed the video!
That was incredible...It just makes you think about different possibilities on how to represent information...
Really incredible explanation! Clear, clever, and concise! Very well done.
Computer out of domino: cool
Domino out of computer: cooler
Great video 👍
A domino AND gate that I've made in the past is just a lot of dominoes packed together, so the weight of two dominoes is required to push them.
lmao you also made logic gates out of dominoes?
@@haroldp.sadwood1181 Yeah but I didn't get very far, I made an XOR gate but it was way more complicated than the one in the video.
@@decb.7959 That's still sick. I would never have thought of this.
thats a neat way to explain how computer stuff workds
This is more cleaner than a minecraft 32 bit computer.
And weirder
This is Very cool! we did this in my compute science class last month it was a very good activity
Oh yeah this is very cool:D
Glad you enjoyed!
Spanning Tree 😊👍
2:45 this AND function is incredible and incredibly smart i love it
The thing to remember is that this is a single iteration circuit, so to make a computer would require some kind of reset functionality.
If you’re curious, there is such a thing as “domino logic” in digital logic design!! It starts with assuming the output is a 1, and will discharge the output to a 0 if the gate needs it. This change can cause more gates to fall from 1 to 0, and so on, hence “domino”, and is used because it is significantly faster than traditional (CMOS) circuits
But can you run doom on it?
Theoretically yes!
Great video! I find it so interesting that a computer’s logic can be so simple to be made with dominoes but so complex at the same time.
You can't build a computer if you can only use each gate once. You can't feed your input with the last input so you can only build combinational logic but not sequential logic and therefore no computer. Also you can't build flipflops.
yes thats exactly what i thought and thats the issue with most of these logic gate alternatives, they cant be reset or turned on or off again
This takes me back to school. Don't get to work with hardware design very often!
I wish I could've seen this about 19 years ago lol I think this is one of my new favorite channels
I thought of this when I was ten, cool to see someone actually performing it
This is a cool way to conceptualize the logic. However, the dominoes would be hard to take past adders because they are timing-reliant, some of your circuits feed back through the inputs which can be a problem, and, of course, you can't reuse circuits.
amazing! This is such a clear way to visualize computer curcuits!
this video makes me more knowing about the computers science than makes me have fun
Thanks for actually showing this to me when I theorize that this can work.
you made this so much easier to understand
It's satisfying and clever. Also, have you noticed that the OR gate inputs provide twice the kinetic energy when activated simultaneously? That means third logical level can be implemented.
You deserve more views my friend this helps boil it down in a way that is relatable to humans. Great stuff !!
When I was in high school, this was really fun to learn during classes
Dammnnn. This is a great way of visually explaining how a computer works. Kudooss
Citing Liu's "3 body problem" book has an emperor who uses an army of tens of thousands of men to create a physical computer similar to this.
Though I learned about simple logic gates through playing Minecraft I grasped the concept of said gates much more through this video. Thank you!
Now I want to see an animation in which the long paths are barely long enough to be interrupted
I learned so much more here so much faster than I did in computer engineering school
“What ya doing with all them dominoes, son?”
“Playing Doom.”
i was studying some mathematics and THIS is what youtube reccomended me (cool video btw)
I'm actually watching this video on a computer made of dominos, this is very relevant
The back music is very calming!
This is so cool! One of the most creative things I've seen on TH-cam. But maybe you just learned in computer school and I'm dumb, lol!
This is my first-ever comment on TH-cam. Your videos are so amazing that I can't just watch and pass by. I want you to know that, thanks.
shout out to Matt Parker of course, who really did this
excellent video, though I will confess I was a little disappointed they weren't real dominos
Let it be known that I'm your 738th subscriber. Can't wait for you to reach 1 million.
Great visualizations, thanks for your hard work!
Don't sell your desktop computer just yet ...
Fascinating as infographix animation though !!!
Next episode: domino hard drive ... :D
the worst thing about this is that you can not have a clock, and use the same row of dominos to run current again, but this was such an interesting video, it was really fun to see designs for different gates.
Computers in the 20th century: Size of a room.
Computers in the 21st century: Size of a Poptart.
Computers in 2021: Size of an airport.
“How fast is it?”
“About twelve flops.”
“That’s not fast.”
“Twelve dominoes flopping over per second is pretty fast.
thank god, this is so much clear now, so easy to understand, genius
'Using the force to create a computer' would have been a funny title.
Hey i thought making a about domino computer back in high school but couldn't sync the various gates.😅 This felt soo nostalgic!
Why weren't you my Programming I professor back in 1995? I might have stayed in the Computer Science major and made millions...
Well,we can only imagine circuits with Dominos,where inputs are fixed. If the inputs changes then you have to manually put together the Dominos again for it to work as depicted.
Hence you can't imagine sequential logic, fsm,Controllers or calculate logic operations for sequence of data nor memory operations.
Hence even hypothetically,you can't make a simple Turing machine with this concept.
However it's a good depiction of computer logics for high-school students.
I had to scroll down waaay too much to find your comment.
Well, let's make Minecraft with dominoes XD
Awesome video
No wonder my computer is getting so slow. It has to wait for those little guys inside to set up the dominoes again after every calculation.
What a curious way to show how logic gates work, that was amazing!
This is literally how Windows works - also the irony is not lost on me that a significant amount of computing was required to simulate the domino’s to make a basic computer
You can build a computer from anything but the gates are supposed to be able to work more than once.
Super cool idea. Though I was hoping to see the simulation for two whole bytes being added.
This explained the mechanics behind the circuit and now I am good at Minecraft redstone
I never knew dominos could be so interesting.
I learned more in this then I had in my college course for computer structure
It is a matter of time until someone builds a domino computer that can run Doom.
Best computer principle explanation ever
I can visualize miles of plates, each with a different circuit of hinged dominoes on it. They get started by punch cards and punch cards using weighted spiked dominoes at the end. And the whole thing resets all dominoes every clock cycle. Like an IRL Minecraft computer.
these domino circuit components are incredible
The best best best explanation on how computing works. Amazing
Yooo, it’s the guy who got me through several CS50 weeks!
BEST thing I have seen in a while
If one domino fails to fall, you call it a "computer glitch"
okay, now that you got the design, get one of those domino clubs to build a calculator, ask the guiness world record team for an arbitrary input, then calculate that task using real dominoes.