2026-09-19T12:16:28Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/300852022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Thomas F. Knight.
Homsy, George E. (George Edward), 1965-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-03-24T18:18:04Z
2006-03-24T18:18:04Z
2004
2004
http://hdl.handle.net/1721.1/30085
55667311
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 167-174).
A class of novel computers uses solute concentrations of distinct chemical species as logic signals and diffusion for signal transport. I establish a bound on the speed, density, and error rate of such computers from first principles. I let the chemical computer engineer choose a "design tuple" of independent parameters: number of chemical species, total solute concentration, signal molecule size, and a parameter called the "cell size". I establish a functional relation between the design tuple, and the "performance tuple": (operating frequency, signal density, error rate). I give a lower bound on the probability of a logic error in one computation step, and an upper bound on the frequency of operation, both as functions of the design tuple. I evaluate these bounds for ssDNA oligomers, and conclude that DNA computation has unacceptable error rates if the hybridization regions are less than eight nucleotides in length. I then argue that, given a suitable scalar-valued performance metric as a function over performance tuples, there is a globally optimal design tuple maximizing performance. I present two conjectures seeking to explain (a) why neurons use small molecules to transport information, and (b) why cells have the size they do. In part two I develop such a performance metric based on Toffoli's computation capacity and computation density, extending and generalizing in these ways: * as a local statistic on a uniform system, it can be evaluated for very large systems without exhaustive counting
(cont.) * it explicitly takes the error rate of the underlying physical process into account I then show a relation between this metric, and a quantity of dynamic systems called specific ergodicity. This is a novel result of theoretical importance, and is the central result of part two. It allows me to unambiguously compare the utility of computers varying vastly in speed, error rate, and signal density. I compare the maximum possible performance of proposed DNA computers from the literature with current commodity electronic computers, and conclude that diffusion-driven, DNA hybridizaton based computers cannot exceed the performance of current electronic computers by more than a factor of 40000, and probably by much less.
by George E. Homsy, II.
Ph.D.
174 p.
6237476 bytes
6237283 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Performance limits on chemical computation
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2bd45a58-be8a-4954-876a-af4546f935ea">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Performance limits on chemical computation</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Homsy, George E. (George Edward), 1965-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>A class of novel computers uses solute concentrations of distinct chemical species as logic signals and diffusion for signal transport. I establish a bound on the speed, density, and error rate of such computers from first principles. I let the chemical computer engineer choose a "design tuple" of independent parameters: number of chemical species, total solute concentration, signal molecule size, and a parameter called the "cell size". I establish a functional relation between the design tuple, and the "performance tuple": (operating frequency, signal density, error rate). I give a lower bound on the probability of a logic error in one computation step, and an upper bound on the frequency of operation, both as functions of the design tuple. I evaluate these bounds for ssDNA oligomers, and conclude that DNA computation has unacceptable error rates if the hybridization regions are less than eight nucleotides in length. I then argue that, given a suitable scalar-valued performance metric as a function over performance tuples, there is a globally optimal design tuple maximizing performance. I present two conjectures seeking to explain (a) why neurons use small molecules to transport information, and (b) why cells have the size they do. In part two I develop such a performance metric based on Toffoli's computation capacity and computation density, extending and generalizing in these ways: * as a local statistic on a uniform system, it can be evaluated for very large systems without exhaustive counting</Abstract>
<Abstract>(cont.) * it explicitly takes the error rate of the underlying physical process into account I then show a relation between this metric, and a quantity of dynamic systems called specific ergodicity. This is a novel result of theoretical importance, and is the central result of part two. It allows me to unambiguously compare the utility of computers varying vastly in speed, error rate, and signal density. I compare the maximum possible performance of proposed DNA computers from the literature with current commodity electronic computers, and conclude that diffusion-driven, DNA hybridizaton based computers cannot exceed the performance of current electronic computers by more than a factor of 40000, and probably by much less.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>