I help students develop rigorous mathematical reasoning through formal languages, automata, Turing machines, decidability, and computational complexity.
The role involves guiding students through proof techniques and difficult theoretical problems, introducing complexity classes such as P and NP, and discussing alternative models including quantum computing. I also mark assessments and provide feedback focused on clarity and sound reasoning.