Patent ID: 6266569
Filing Date: 2001-07-24
Classification: B82Y,C12Q,G06N

Abstract:
A Brownian Turing machine comprising:a multiplicity of alphabet elements defining a plurality of different types of information;multiple state transition elements defining how said machine can change state;a single enzymatic unit for receiving dimers one at a time, wherein each dimer is comprised of one state transition element combined to one alphabet element, for determining if a dimer is an allowable next dimer and, if it is, for connecting the state transition element of the allowed dimer to a history tape of the history of at least one change of state and for modifying an alphabet tape, comprising at least two alphabet elements connected together, with the alphabet element of the allowed dimer in accordance with the state transition defined by the state transition element of the allowed dimer,wherein said alphabet elements and said state transition elements are mechanical blocks and said enzymatic unit is formed of mechanical parts.