Biomod/2013/MIT

From OpenWetWare

(Difference between revisions)
Jump to: navigation, search
Line 5,547: Line 5,547:
<li><a href="http://openwetware.org/wiki/Biomod/2013/MIT">Home</a></li>
<li><a href="http://openwetware.org/wiki/Biomod/2013/MIT">Home</a></li>
<li><a href="MITproject.html">Project</a></li>
<li><a href="MITproject.html">Project</a></li>
 +
                                                                <li> <a href="Videos.html">Videos</a></li>
<li><a href="about-us.html">Team</a></li>
<li><a href="about-us.html">Team</a></li>
<li><a href="references.html">References</a></li>
<li><a href="references.html">References</a></li>
Line 5,632: Line 5,633:
  <a href="http://openwetware.org/index.php?title=Biomod/2013/MIT&action=edit" align=right>Edit</a>
  <a href="http://openwetware.org/index.php?title=Biomod/2013/MIT&action=edit" align=right>Edit</a>
</div><!--/ .container-->
</div><!--/ .container-->
 +
</div>
</body>
</body>
</html>
</html>

Revision as of 01:02, 28 October 2013

MIT Self-Assembly Lab 2013

GOL-03
Can we make the patterns of Conway's Game of Life with DNA? Can we make patterns transition between stages?


What is Conway's Game of Life?
The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970.The game consists of a collection of cells which, based on a few mathematical rules, can live, die or multiply. Depending on the initial conditions, the cells form various patterns throughout the course of the game.

The Rules:
1. Each cell with 1 or no neighbors dies.
2. Each cell with 4 or more neighbors dies.
3. Each cell with 2 or 3 neighbors survives.
4. Each cell with 3 neighbors becomes populated.


Watch The Game of Life Video
Edit

Views
Personal tools