Date of Graduation
5-2023
Document Type
Thesis
Degree Name
Bachelor of Science in Computer Science
Degree Level
Undergraduate
Department
Computer Science and Computer Engineering
Advisor/Mentor
Patitz, Matthew
Committee Member/Reader
Wang, Yong
Committee Member/Second Reader
Zhang, Lu
Abstract
I first give a brief introduction to formal models of computation. I then present three different approaches for computation in the aTAM. I later detail generating systems of crisscross slats given an arbitrary algorithm encoded in the form of a Turing machine. Crisscross slats show potential due to their high levels of cooperativity, so it is hoped that implementations utilizing slats are more robust to various growth errors compared to the aTAM. Finally, my software converts arbitrary crisscross slat systems into various physical representations that assist in analyzing their potential to be realized in experiments.
Keywords
Self-assembly; Crisscross slats; DNA computing; Polyominos
Citation
Bullard, J. S. (2023). Universal Computation Using Self-Assembling, Crisscross DNA Slats. Computer Science and Computer Engineering Undergraduate Honors Theses Retrieved from https://scholarworks.uark.edu/csceuht/121
