This article explores the idea of origami being “Turing complete”, meaning it can solve any tractable computational problem. Mathematicians Inna Zakharevich and Thomas Hull proved that origami can be used as a universal computer. They demonstrated how to encode computational inputs, logical operations, and outputs as folds of paper. By designing different gadgets and using crease patterns, they were able to simulate logical operations like AND and OR. While an origami computer may not be practical and efficient, the math and algorithms developed in origami have real-world applications, such as designing solar panels, robots, and medical devices. This research aims to establish deeper connections between origami and established branches of mathematics.
| Signal | Change | 10y horizon | Driving force |
|---|---|---|---|
| Origami proven to be Turing complete | From origami as a hobby to a computational tool | Origami used for complex computational tasks | Exploring the limits of computation |
| Origami used for encoding logical operations | From traditional computing to origami-encoded operations | Origami used as a method for logical computations | Advancements in the field of origami and mathematics |
| Potential applications of origami in computing | From inefficient to practical applications of origami | Origami used for calculations, weather prediction, etc. | Advancements in origami and engineering |
| Origami’s potential for interdisciplinary usage | From limited use to a crossover with other branches of math | Origami integrated into various fields of science and math | Exploration of new possibilities and applications |