Re: [Origami] Origami is proven to be even harder than we thought!

Den 30. jan. 2024 kl. 18.11 skrev Robert Lang : > Tom Hull and Inna Zakharevich have shown that it’s even harder: “Turing > complete,” meaning that for any tractable computational problem, one can > construct a crease pattern whose solution would solve the problem. Really interesting! I never

[Origami] Origami is proven to be even harder than we thought!

article in Quanta magazine explaining what that means. https://www.quantamagazine.org/how-to-build-an-origami-computer-20240130/