L'homme n'est qu'un roseau, le plus faible de la nature ; mais c'est un roseau pensant. — Blaise Pascal, Pensées
Computer Science × Algebra
Hey! Glad that you found me. I am a graduate in Computer Science and have great interests in specific fields of mathematics, computer science and software engineering.
For math, I have great passion in algebra and Category Theory; for CS, algorithm analysis; for SWE, all the methodologies for PM and state-of-the-art technologies. I decided that I could use some virtual space to keep track of my growth in all the fields above, which brought into being this very website.
My name is Yi Hu, a graduate of the University of Iceland, where I completed Computer Science (BSc.). My interests sit at the boundary between algebra and computational theories.
The heart of my mathematical interest is algebra and, within it, Category Theory: the study of structure itself, independent of the particular objects that instantiate it. What draws me to categorical thinking is not its generality for its own sake, but the way it forces precision, constructions that feel intuitive in one domain turn out to rely on properties that are genuinely rare, and category theory makes that visible.
My interest in algorithms concerns their mathematical depth rather than their practical application. I am drawn to advanced algorithmic techniques, particularly those where the correctness or efficiency of a procedure follows from non-obvious combinatorial or algebraic structure. The fact that an algorithm works is less interesting to me than the reason it works.
Outside of mathematics, I build and maintain systems for the web, currently deployed on Cloudflare's edge network.
My long-term academic goal is to pursue a Master's degree in Mathematics or Computer Science at a research-intensive European university. I am drawn to programmes with strong foundations in logic, algebra, and theoretical computer science.
In particular, I aspire to join the graduate programme at the University of Copenhagen, whose faculty has contributed substantially to both topology and the theory of programming languages. The proximity of the CS and Mathematics departments there makes it an especially compelling environment for the kind of interdisciplinary work I hope to pursue.
More broadly, I want to work on problems where rigorous mathematical abstraction and practical computation converge — whether in the semantics of programming languages, the foundations of type theory, or the categorical structure of formal systems.
Hover to explore
Hover to explore
Hover to explore
Hover to explore
Every object in a category is completely determined by how other objects map into it — or out of it. A guided reading of the Yoneda lemma and why it matters beyond the technicality.
The correspondence between intuitionistic propositions and types, between proofs and programs. Why a correct program is literally a proof, and what breaks when you add exceptions or mutable state.
Mac Lane wrote that "adjoint functors arise everywhere." A survey of the most striking instances — free/forgetful, product/hom, syntax/semantics — and what it means for two constructions to be mutually adjoint.
I welcome correspondence on Category Theory, compiler design, or anything at the intersection of mathematics and theoretical computer science. Open to academic collaboration and interesting side projects.