I am currently involved in projects involving reverse mathematics and computable topology.
I graduated from UC Berkeley in May 2020. I wrote my senior honors thesis, Bernoulli Randomness and Bernoulli Normality, under the supervision of Professor Theodore Slaman. The paper was published in Mathematical Logic Quarterly here. An earlier version is available as a pre-print on arXiv here.
Those who are interested in dynamical systems are encouraged to see the GitHub repository for the IFS Code Visualizer program I wrote as part of my senior honors thesis. My thesis ends on a few open questions regarding iterated function systems and randomness, and the IFS Code Visualizer allows for computational exploration of those questions. A web version is now available here.
Below, some JavaScript code is generating the Barnsley Fern using four different sequences. This code runs in the browser using the p5.js library for JavaScript. The code can be viewed here. The visualization demonstrates that the speed at which the Barnsley Fern is generated can vary for different sequences, even though the sequences are all Bernoulli normal to the same probabilities. It is unknown (to me, at least) whether the same fractals are generated if the sequences are all Bernoulli normal to the same probabilities. The biasing algorithm from my paper is also implemented in the code to bias Champernowne's, Copeland-Erdos's, and Besicovitch's sequences.
Click here to open it in a new tab.