Method and system of computing similar to a turing machine
US6266569A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Nov 2, 1998 |
| Grant date | Jul 24, 2001 |
| Priority date | — |
| Expiry date | Nov 2, 2018 |
Classification
- Technology area (CPC C)Chemistry; Metallurgy
- CPC primaryC12Q1/00
- WIPO fieldBiotechnology
- WIPO sectorChemistry
Abstract
A Brownian Turing machine includes a multiplicity of alphabet elements, multiple state transition elements and a single enzymatic unit. The alphabet elements define a plurality of different types of information. The state transition elements define how the machine can change state. The enzymatic unit receives dimers one at a time, wherein each dimer is comprised of one state transition element combined to one alphabet element. The enzymatic unit determines if a dimer is an allowable next dimer and, if it is, connects the state transition element of the allowed dimer to a history tape of the history of at least one change of state. The enzymatic unit also modifies 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. The alphabet elements, state transition elements and enzymatic unit can be mechanical, chemical or biological elements.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.