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
    9·
    2 年前

    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?

    • unomar@midwest.socialEnglish
      5·
      2 年前

      My assumption is that you’d need to actually fold these to work and that by selecting the inputs and laying them flat, the output naturally also lays flat. If there is a way to properly read them via the diagrams I’d love to know though.

    • abhi9u@lemmy.worldOPEnglish
      2·
      2 年前

      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.