Over the years, advances in research have continued to decrease the size of computers from the size of<br/>a room to a small device that could fit in one’s palm. However, if an application does not require extensive<br/>computation power nor accessories such as a screen, the corresponding machine could be microscopic,<br/>only a few nanometers big. Researchers at MIT have successfully created Syncells, which are micro-<br/>scale robots with limited computation power and memory that can communicate locally to achieve<br/>complex collective tasks. In order to control these Syncells for a desired outcome, they must each run a<br/>simple distributed algorithm. As they are only capable of local communication, Syncells cannot receive<br/>commands from a control center, so their algorithms cannot be centralized. In this work, we created a<br/>distributed algorithm that each Syncell can execute so that the system of Syncells is able to find and<br/>converge to a specific target within the environment. The most direct applications of this problem are in<br/>medicine. Such a system could be used as a safer alternative to invasive surgery or could be used to treat<br/>internal bleeding or tumors. We tested and analyzed our algorithm through simulation and visualization<br/>in Python. Overall, our algorithm successfully caused the system of particles to converge on a specific<br/>target present within the environment.

Cancer rates vary between people, between cultures, and between tissue types, driven by clinically relevant distinctions in the risk factors that lead to different cancer types. Despite the importance of cancer location in human health, little is known about tissue-specific cancers in non-human animals. We can gain significant insight into how evolutionary history has shaped mechanisms of cancer suppression by examining how life history traits impact cancer susceptibility across species. Here, we perform multi-level analysis to test how species-level life history strategies are associated with differences in neoplasia prevalence, and apply this to mammary neoplasia within mammals. We propose that the same patterns of cancer prevalence that have been reported across species will be maintained at the tissue-specific level. We used a combination of factor analysis and phylogenetic regression on 13 life history traits across 90 mammalian species to determine the correlation between a life history trait and how it relates to mammary neoplasia prevalence. The factor analysis presented ways to calculate quantifiable underlying factors that contribute to covariance of entangled life history variables. A greater risk of mammary neoplasia was found to be correlated most significantly with shorter gestation length. With this analysis, a framework is provided for how different life history modalities can influence cancer vulnerability. Additionally, statistical methods developed for this project present a framework for future comparative oncology studies and have the potential for many diverse applications.

Optimal foraging theory provides a suite of tools that model the best way that an animal will <br/>structure its searching and processing decisions in uncertain environments. It has been <br/>successful characterizing real patterns of animal decision making, thereby providing insights<br/>into why animals behave the way they do. However, it does not speak to how animals make<br/>decisions that tend to be adaptive. Using simulation studies, prior work has shown empirically<br/>that a simple decision-making heuristic tends to produce prey-choice behaviors that, on <br/>average, match the predicted behaviors of optimal foraging theory. That heuristic chooses<br/>to spend time processing an encountered prey item if that prey item's marginal rate of<br/>caloric gain (in calories per unit of processing time) is greater than the forager's<br/>current long-term rate of accumulated caloric gain (in calories per unit of total searching<br/>and processing time). Although this heuristic may seem intuitive, a rigorous mathematical<br/>argument for why it tends to produce the theorized optimal foraging theory behavior has<br/>not been developed. In this thesis, an analytical argument is given for why this<br/>simple decision-making heuristic is expected to realize the optimal performance<br/>predicted by optimal foraging theory. This theoretical guarantee not only provides support<br/>for why such a heuristic might be favored by natural selection, but it also provides<br/>support for why such a heuristic might a reliable tool for decision-making in autonomous<br/>engineered agents moving through theatres of uncertain rewards. Ultimately, this simple<br/>decision-making heuristic may provide a recipe for reinforcement learning in small robots<br/>with little computational capabilities.