Self-Assembly of a Statistically Self-Similar Fractal

Details Self-Assembly of a Statistically Self-Similar Fractal Self-Assembly of a Statistically Self-Similar Fractal

2009-04-10

arxiv.org/abs/0904.1630v3

Computer Science

Computational Complexity

I am withdrawing all work I would like to polish before resubmitting, including this paper. Several typos fixed

Scientific paper

We demonstrate existence of a tile assembly system that self-assembles the statistically self-similar Sierpinski Triangle in the Winfree-Rothemund Tile Assembly Model. This appears to be the first paper that considers self-assembly of a random fractal, instead of a deterministic fractal or a finite, bounded shape. Our technical contributions include a way to remember, and use, unboundedly-long prefixes of an infinite coding sequence at each stage of fractal construction; a tile assembly mechanism for nested recursion; and a definition of "almost-everywhere local determinism," to describe a tileset whose assembly is locally determined, conditional upon a zeta-dimension zero set of (infinitely many) "input" tiles. This last is similar to the definition of randomized computation for Turing machines, in which an algorithm is deterministic relative to an oracle sequence of coin flips that provides advice but does not itself compute. Keywords: tile self-assembly, statistically self-similar Sierpinski Triangle.

Affiliated with

Also associated with

No associations

Rating

Self-Assembly of a Statistically Self-Similar Fractal does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Assembly of a Statistically Self-Similar Fractal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Assembly of a Statistically Self-Similar Fractal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-673403