Want to create an interactive transcript for this episode?
Podcast: Embedded
Episode: It's All Chaos and Horror
Description: 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 pa...