About
Master's Student · Theoretical Computer Science
I'm a master's preparatory student with research interests at the intersection of mathematical logic, type theory, and the theoretical foundations of computation. My long-term goal is to understand how formal methods and logic can clarify — and constrain — what computational systems can and cannot do.
The question is not whether machines can think, but whether we can know when they do — and what that question even means.
I read a lot — mathematics, philosophy of mind, and occasional fiction. I keep notes on what I'm reading in my essays. I also enjoy photography and long walks in places with good architecture.
Education
Your University
Master's Preparatory Program · Department of Computer Science
- Focus: mathematical logic, type theory, computational complexity
- GPA: X.XX / 4.00
Research Interests
- Proof theory & type theory — Curry–Howard correspondence, dependent types, proof assistants (Coq, Lean 4, Agda), normalization by evaluation
- Mathematical logic — Model theory, set theory, computability theory, descriptive complexity
- Computational complexity — Circuit complexity, oracle separations, interactive proofs, randomized algorithms
- Foundations of ML — PAC learning theory, VC dimension, statistical learning theory, information-theoretic bounds
Research Experience
Research Assistant
Your University · Supervisor: Prof. X
Investigating the expressibility of higher-order recursion schemes via game semantics and modal mu-calculus.
Publications
Skills
Programming
Mathematics
Tools
Languages
Awards & Honors
Contact
Email: you@example.com
GitHub: github.com/yourhandle