PDF-COMPLEXITY OF SELF ASSEMBLED SHAPES
The connection between selfassembly and computation sugg ests that a shape can be considered the output of a selfassembly program a set of tiles that t together
Download Presentation
"COMPLEXITY OF SELF ASSEMBLED SHAPES" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement. Download
Presentation Transcript
Transcript not available.