Pages that link to "Item:Q3654379"
From MaRDI portal
The following pages link to The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (Q3654379):
Displayed 13 items.
- Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies (Q537828) (← links)
- Self-assembly of decidable sets (Q553922) (← links)
- Limitations of self-assembly at temperature 1 (Q616501) (← links)
- Polyominoes simulating arbitrary-neighborhood zippers and tilings (Q652151) (← links)
- Arithmetic computation in the tile assembly model: addition and multiplication (Q884443) (← links)
- Nondeterministic polynomial time factoring in the tile assembly model (Q924676) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← links)
- Strict self-assembly of discrete Sierpinski triangles (Q1004083) (← links)
- Path finding in the tile assembly model (Q1008725) (← links)
- On the effects of hierarchical self-assembly for reducing program-size complexity (Q2243581) (← links)
- Plane-Filling Properties of Directed Figures (Q3004676) (← links)
- Snakes and Cellular Automata: Reductions and Inseparability Results (Q3007629) (← links)
- Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue (Q3092340) (← links)