Hardware Podcasts

474: It's All Chaos and Horror

Embedded.fm · 5 Apr 2024 · 1h 11m · Episode 474

What this episode covers

Professor Inna Zakharevich of Cornell University explains how she and collaborator Tom Hull proved that flat origami is Turing complete by implementing logic gates and Rule 110 cellular automata in paper crease patterns. They designed origami NAND, NOR, AND, OR, and NOT gates using a hexagonal grid, overcoming challenges with intersecting pleats and signal reflection to simulate Rule 110. Zakharevich discusses the mathematical rigor required to prove these structures fold flat without interference, contrasting the theoretical proof with the practical difficulty of folding large-scale patterns like the Sierpiński gasket.

Most relevant to

early-stage companies

Topics

Mentioned

Companies
Cornell University
Products
Turing Tumble
Tools
Silhouette Cameo 4 Pro, TikZ, LaTeX
Also
Satoshi Kamiya, John Montroll, Veritasium

Related episodes from other shows

Other shows on the same ground, closest first.

  • Hackaday Podcast · 53m

    Ep010: XKCD Graphs, Turing Complete Meta Computers, False Finger Printing 3D Printers, and Jargon

    Hackaday editors Mike Szczys and Elliot Williams review the week's hacker projects, including a 12-channel LED spectrum mixer, an omni-wheeled pen plotter, and a Turing-complete system built from hospital nurse call devices. They analyze a paper claiming to fingerprint 3D printers, arguing the method is flawed because it ignores filament variability, and discuss NASA's engineering philosophy of over-specifying hardware for long mission lives, citing the Opportunity rover and Voyager probes. The episode also features a jargon quiz on 'astrictive robotic prehension' and a new '$50 Ham' column.

    PCB design & layoutMechanical engineering
    8 chapters

The summary, chapters and topics are generated from the episode’s audio by this directory, not written by Embedded.fm. The episode itself belongs to its publisher.