Flat origami is Turing complete (2023) (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: Flat origami is Turing complete (2023)

First screen, captured 1 year ago.

Looks similar

Screenshot of arxiv.org: Tiling with Three Polygons Is Undecidable

Tiling with Three Polygons Is Undecidable (arxiv.org)

122 points by denvaar 1 year ago | 25 comments

$Screenshot of arxiv.org: Integer continued fractions for complex numbers$

Integer continued fractions for complex numbers (arxiv.org)

45 points by bikenaga 1 year ago | 2 comments

Screenshot of arxiv.org: A convex polyhedron without Rupert's property

A convex polyhedron without Rupert's property (arxiv.org)

23 points by robinhouston 1 year ago | 3 comments

Screenshot of arxiv.org: Turing Completeness of GNU find

Turing Completeness of GNU find (arxiv.org)

97 points by todsacerdoti 8 months ago | 25 comments

Screenshot of arxiv.org: Flip Distance of Convex Triangulations and Tree Rotation Is NP-Complete

Flip Distance of Convex Triangulations and Tree Rotation Is NP-Complete (arxiv.org)

22 points by nill0 8 months ago | 0 comments

Screenshot of arxiv.org: Multiword matrix multiplication over large finite fields in floating-point

Multiword matrix multiplication over large finite fields in floating-point (arxiv.org)

23 points by 7777777phil 9 months ago | 0 comments