Domino Addition – Numberphile

Matt’s Big Domino Computer:
More links & stuff in full description below ↓↓↓

More of this interview:

This video features Matt Parker:
Numberphile videos featuring Matt:

Support us on Patreon:

Numberphile on Facebook:
Numberphile tweets:

Numberphile is supported by the Mathematical Sciences Research Institute (MSRI):

Videos by Brady Haran

Brady’s videos subreddit:

Brady’s latest videos across all channels:

Sign up for (occasional) emails:

Numberphile T-Shirts:
Other merchandise:


Xem thêm bài viết khác:

41 thoughts on “Domino Addition – Numberphile

  1. 5:33 There's the magic sentence: "I'll give it a go." Totally different context now, but I can't stop noticing it when rewatching older videos.

  2. Ok, Matt, here's a challenge for you: using dominoes, build a NOT gate, ie one input, if that input is 0, the output is 1, and vice versa.

  3. I doubt you're reading comments on multi-year old Numberphile videos, Brady, but this is probably my new favorite Numberphile video. I've always wondered about the very very fundamentals about how this kind of logic stuff works, and binary, and reading about it elsewhere has just made my peabrain struggle, so I'm glad to have found this all of a sudden.

  4. Is addition an O(log n) problem at the machine level, since it requires log_2(n) full-adders to get an output?

  5. 13:50 Well, okay, we all use 42 as a placeholder number, I get that. What's weird, is that I constantly use 17 as another placeholder number, and here it is, 42 and 17. What a creepy coincidence 🤔

    Matt only pushed one input, so this means
    in1=0 in2= 1,
    so 0 xor 1 = 1 and this will make output(units) "true" i.e. this dominoes will fall when in1 + in2 = 1
    0 and 1 = 0 = making "true" the output(twos), i.e. this dominoes will fall when in1 + in2 = 2
    in the video, half adder computes output(twos) after 0 + 1…

  7. Mathematicians really are the smartest people in the world. They've found a way to get paid for playing with dominos all day. Now that is clever!

  8. 20 years I've been trying to understand computers on a fundimental level, and I think I finally do.

Leave a Reply

Your email address will not be published. Required fields are marked *