Flat origami is the folding of flat paper in such a way that the finished object lies in a plane. In their recent paper Flat origami is Turing Complete, Thomas C. Hull and Inna Zakharevich prove that it is possible to view flat origami as a Turing complete computational device. This means that, in principle, it is possible to use flat origami to compute anything that a traditional computer is able to compute.
I don’t know. I have found that the folks on Technology community appreciate many of my computer science posts. But a dedicated Comp Science community which is active, will be awesome.
Check out programming.dev for a Comp Sci focused community.
Thank you!