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

[Papirfoldning.dk]

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 even thought about origami in terms of computations, only as passive 
problems being solved by computers as was done with the NP-completeness.
So the new insight here is the idea of designing creases that enforces other 
creases to be formed, i.e., active operations, obtained by imposing the 
constraints of flat-foldability.

Regards,
Hans

Hans Dybkjær
http://papirfoldning.dk
Society: http://foldning.dk

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

[Robert Lang]

We already knew that origami was hard (in the NP-complete sense), but 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. A nice article in Quanta 
magazine explaining what that means.

https://www.quantamagazine.org/how-to-build-an-origami-computer-20240130/