Show simple item record

dc.contributor.advisorThomas F. Knight.en_US
dc.contributor.authorHomsy, George E. (George Edward), 1965-en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2006-03-24T18:18:04Z
dc.date.available2006-03-24T18:18:04Z
dc.date.copyright2004en_US
dc.date.issued2004en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/30085
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.en_US
dc.descriptionIncludes bibliographical references (p. 167-174).en_US
dc.description.abstractA 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 countingen_US
dc.description.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.en_US
dc.description.statementofresponsibilityby George E. Homsy, II.en_US
dc.format.extent174 p.en_US
dc.format.extent6237476 bytes
dc.format.extent6237283 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titlePerformance limits on chemical computationen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc55667311en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record