General computation using slidable tiles with deterministic global forces
From MaRDI portal
Cites work
- Fast reconfiguration of robot swarms with uniform control signals
- Four Small Universal Turing Machines
- Four Small Universal Turing Machines
- Full tilt: universal constructors for general shapes with uniform external forces
- Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External Forces
- Particle computation: complexity, algorithms, and logic
- Particle-based assembly using precise global control
- PSPACE-completeness of reversible deterministic systems
- Single-exception sorting networks and the computational complexity of optimal sorting network verification
- Systolic VLSI Arrays for Polynomial GCD Computation
- Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
- Uniform robot relocation is hard in only two directions even without obstacles
This page was built for publication: General computation using slidable tiles with deterministic global forces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445526)