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.
  • JohnnyCanuck@lemmy.caEnglish
    8·
    1 year ago

    This is really neat. I haven’t been able to figure out how to read the NAND and NOR gate examples though.

    Is there a good comp sci community on Lemmy?