Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms
Connecting descriptive combinatorics with computable combinatorics through ASI algorithms, preprint with Felix Weilacher
Publications
Computability-theoretic complexity of effective Banach spaces
Examining the complexity of various geometric properties of Banach spaces through the lense of computability theory, Master Thesis supervised by Prof. Rod Downey and Prof. Noam Greenberg