Computing with self-assembling tiles

Part 1: Construct a Turing machine which sums two binary numbers.  Your input format will be the 2 binary strings separated by a blank space.  The two binary strings are not necessarily the same length.

·         Turn in:  a write-up of your Turing machine

Part 2:  Convert your Turing machine into an aTAM tile system.  The initial tape may be encoded as a multiple-tile seed assembly.  Enter your system into the VersaTILE simulator and test it with a number of examples to ensure there are no bugs.

·         Turn in 1: A write-up of your tile system.  Include analysis for how asymptotically large your tileset is with respect to the general Turing machine you are implementing, e.g., how does your tile system scale in terms of the number of rules, number of states, number of symbols, etc.

·         Turn in 2: A screen shot of the VersaTILE final assembly of your system for input 101 11