Harsha Tirumala is currently a graduate student at Rutgers University and their research interests lie in meta complexity theory. Specifically hardness results for the Minimum Circuit Size problem, the Minimum Kolmogorov Time problem and their connections to complexity theory objects/ classes interest him.