Theses and Dissertations

Date of Award

5-2023

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Dr. Timothy Wylie

Second Advisor

Dr. Robert Schweller

Third Advisor

Dr. Bin Fu

Abstract

As it becomes increasingly harder to make transistors smaller, replacements for traditional silicon computers become sought after. To study the computing power of these potential computers, various theoretical models have been proposed, such as the abstract Tile Assembly Model (aTAM) and chemical reaction networks (CRNs). This thesis compiles research in various models such as the aTAM, Tile Automata, and CRNs. This work shows an investigation of covert computation in the aTAM and an evolutionary algorithm to approximate solutions to the pattern self-assembly tile set synthesis (PATS) problem. Next, optimal state complexity for building squares in Tile Automata is shown along with a Tile Automata simulation of the staged assembly model (SAM). Lastly, reachability for restricted general CRNs, reachability for feed-forward CRNs, and reachability for Void and Autogenesis CRNs are shown to be in various complexity classes.

Comments

Copyright 2023 Andrew Rodriguez. All Rights Reserved.

https://go.openathens.net/redirector/utrgv.edu?url=https://www.proquest.com/dissertations-theses/problems-algorithmic-self-assembly-genetic/docview/2842918195/se-2?accountid=7119

Download

Share

COinS