Things to Make and Do in the Fourth Dimension | Matt Parker | Talks at Google

Main ideas, concepts, and lessons

• Matt Parker’s background and goal

  • He’s a former high school math teacher from Australia who later moved to London.
  • He now works in math education and communication, including:
    • university public engagement,
    • writing and speaking,
    • stand-up,
    • and math-focused media—especially YouTube.
  • He frames the talk as sharing “favorite bits” of math (including some live math), presented in an entertaining style similar to his books and videos.

• Math “in the real world” via error detection/correction

  • The talk emphasizes that practical technologies—such as barcodes, credit cards, text messaging, and Blu-rays—depend on mathematical patterns that:
    • detect misreads,
    • correct missing or corrupted information,
    • enable reliable reconstruction even when there’s noise or scanning errors.
  • He compares error correction in text messaging to solving Sudoku-like constraints, where consistent patterns across rows, columns, and sub-sections narrow down what’s correct.

• “Useful math” demonstrations

  • He demonstrates a range of practical and conceptual ideas, including:
    • a quick mental method related to cubing two-digit numbers,
    • a barcode check digit guessing trick,
    • a shoelace-tying method explained as an underlying “same knot” (a practical knot theory idea),
    • knot theory’s open problems and their implications for biology and medicine,
    • a mechanical geometry demonstration using two rotating disks whose center of mass stays at a constant height.

• Domino logic: building computers with physics

  • He models Boolean logic gates with domino chains (e.g., AND, XOR).
  • He scales up to:
    • a binary counting circuit,
    • then a full adder.
  • He reports building a working “domino computer” capable of adding numbers, noting challenges such as:
    • synchronization (timing),
    • signal bleed.

• A math-based “Christmas present” and error-correcting codes

  • His mom knitted a scarf encoding a message in repeating binary/Unicode-like patterns.
  • A bit flip occurred (one digit changed—effectively a 1/0 error), but:
    • the message repeats multiple times,
    • so the original can be recovered by averaging/cross-checking (i.e., error correction).
  • He calls it an “error-correcting scarf.”

---

Methodologies / instructional content (detailed bullet points)

1) Warm-up calculation: cubing a two-digit number (mental pattern trick)

• Task (what the audience does):

  • Choose any two-digit number.
  • Compute its cube using a calculator/phone/Wolfram Alpha.

• How Parker claims he does it mentally (high-level method):

  • He doesn’t memorize all results.
  • He uses two patterns visible in the cubed output:
    • one pattern determines the first digit of the cube,
    • another pattern reveals information about the second digit of the original two-digit number, as reflected in the cube’s digit structure.
  • While the audience calls out the calculated cube, he “scans” for the patterns to infer which input cube was produced.

• Offer to explain:

  • He says he can explain the method afterward, or that experimenting with cubing spreadsheet entries helps people discover the pattern.

---

2) Barcode check-digit guessing (barcode error detection logic)

• Prerequisite:

  • An audience member brings a product with a retail barcode.
  • The talk distinguishes North American barcode patterns from European differences.

• Instruction to the audience:

  • Look at the barcode and identify its digit layout:
    • there are tiny digits on the left and right (the right-side digit is the check digit he wants to predict),
    • the rest of the digits appear underneath.
  • Read out all digits starting from the left digit, including digits underneath—but do not reveal the right-side digit.

• Parker’s mental calculation method (as described):

  • Treat the digits as positions in order.
  • For US barcodes:
    • add all odd-positioned digits,
    • add all even-positioned digits starting from the first to make a subtotal,
    • multiply the even-position subtotal by 3,
    • add in the remaining skipped digits to get a grand total.
  • The grand total is constrained to be a multiple of 10.
  • The missing final check digit is whatever makes the total reach the next multiple of 10.
  • He then predicts the final digit; if correct, the audience cheers.

---

3) Shoelace tying via “knot self-tying” cross-step

• Instruction (demonstration method):

  • Start with the usual foundation knot to set up loop formation.
  • Make a loop with the right lace:
    • curve it up and forward,
    • hold it at the descending part of the loop.
  • Make a mirrored loop with the left lace:
    • curve it back,
    • hold at the descending part.
  • Pass the part you’re holding under the other loop.
  • Swap hands, then pull to complete the tie.

• Claim:

  • The resulting knot is mathematically the same knot people normally tie, just achieved more directly.

• Optional live participation:

  • Audience members are invited to try it with their own shoes.

---

4) Domino logic: building gates and arithmetic

• Core representation:

  • A domino that falls is 1, and one that remains standing is 0.

• AND gate (two inputs, one output):

  • Output falls only if both inputs are knocked.
  • If either input alone is knocked, the signal does not propagate fully.

• XOR (exclusive OR) gate (two inputs, one output):

  • Configure paths so that:
    • if both inputs are knocked, signals collide and stop (annihilate), preventing output,
    • if only one input is knocked, it reaches the output.

• Binary counting logic (calculator-style):

  • The circuit outputs the binary value for how many inputs are knocked.
  • Output mapping:
    • XOR-like output corresponds to the ones place,
    • AND-like output corresponds to the twos place.

• Full adder (constructing arithmetic):

  • Build a circuit with:
    • two input bits to be added,
    • a carry-in bit,
    • a sum output (“right out”) and carry-out to the next stage.

• Scaling:

  • Chain adders to add larger binary numbers:
    • one full adder for small additions,
    • multiple chained units for multi-digit binary addition.

• Major engineering note:

  • Timing/synchronization and physical effects (e.g., signal bleed, cross-torque) must be controlled so domino falls occur in the correct order.

---

5) Error-correcting scarf (recovering the correct message)

• Encoding idea (described after unwrapping):

  • The scarf is knitted from ones and zeroes arranged in rows.
  • Each row corresponds to an upper-case Unicode letter (as inferred by Parker).
  • The message is repeated multiple times across the scarf.

• Error observation:

  • There is a bit swap (1/0 error) causing one character to be wrong (described as something like “t/u vs v,” e.g., “Maths is fvn…” rather than “Maths is fun…”).

• Correction method (as explained):

  • Because the message repeats four times:
    • compute the average value (equivalently use majority/inference across repeats),
    • recover the intended message despite the single mistaken repeat.

---

Speakers / sources featured

• Speaker: Matt Parker (primary presenter)

• Mentioned/credited people & figures (not separate on-camera speakers):

  • Allen (introduced by the event host; first name not provided)
  • Alan Turing (referenced regarding historical computing; also in relation to someone Parker met)
  • “Very good mathematician Sean” (credited with devising a robust domino junction-building method)
  • Google Hangouts (used as a tool for collaborative build planning)

• Referenced institutions / platforms:

  • Talks at Google (event context)
  • Queen Mary University of London
  • Numberphile (YouTube channel)
  • Wolfram Alpha (used by some audience members)
  • Manchester University / Museum of Science and Industry in Manchester
  • MoMA (mentioned as a location with a fractal mega-installation)
  • Interstellar (film reference for the “tesseract” concept)
  • The Imitation Game (film reference about Turing)

• On-camera speakers:

  • No other distinct on-camera speakers are clearly identified in the subtitles.