[Previous] [Up] [Next]
Go backward to Issues in Design and Simulation of Oligonucleotide Mixtures  
Go up to Progress Report on Work to Date  
Go forward to Discussion of Universal Machine  

Example String Machines  

In this section we describe some of the machine behaviors that we have figured how to implement using the idea of replication-clocked mixture mutagenesis. We will proceed from the simplest machines to the most complex. For each machine, we summarize one or two ways to implement it in oligos. In the next section, we will describe the detailed designs for those machines that we have verified on the simulator.

  • Example 1: Counting Replications  
  • Example 2: One-State Turing Machine  
  • Example 3: Universal Turing Machine and Forward Progress  

  • - Michael P. Frank, September 12, 1995. Formatted using HyperLaTeX-1.3.

    [Previous] [Up] [Next]