474: It's All Chaos and Horror
from Embedded Hosted by Elecia White
Logic gates and origami? Professor Inna Zakharevich joined us to talk about Turing complete origami crease patterns. We started talking about Turing completeness which led to a Conway’s Game of Life-like 2D cellular automaton called Rule 110 (Wikipedia) which can be implemented with logic gates (AND, OR, NOT). These logic gates can be implemented as creases in paper (with the direction of the crease indicating 0 or 1). The paper describing the proof is called Flat Origami is Turing Complete (arxiv and PDF). Quanta Magazine has a summary article: How to Build an Origami Computer. Inna’s page at Cornell University also has the crease patterns for the logic gates (pdf). Inna is an aficionado of the origami work by Satoshi Kamiya who creates complex and lifelike patterns. Some other origami mentioned: Origami Stegosaurus by John Montroll YouTube Folding video (Part 1 of 3) Ilan Garibi’s Pineapple Tessellation (PDF instructions) Eric Gjerde Spread Hex Origami Tessellation (This also has the equilateral triangle grid needed to fold Inna’s gate logic) Peter Engel Amanda Ghassaei’s Origami Simulator (Mooser’s is under Examples->Origami) Some other math mentioned: Veritasium’s Math's Fundamental Flaw talks about Goerthe’s Incompleteness Theorem Physical Logic Game: Turing Tumble - Build Marble-Powered Computers Mathematics of Paper Folding (Wikipedia) Transcript
Embed this episode
No transcript yet.