I M Iqbal <- webring -> Trinity
Back to my homepage
Current literature
Some of the current literature I am reading, and will probably finish in about 10 years. All books are free, unless I have marked it with an asterisk. (Last update 18/05/2025)
Automata Theory and Complexity Theory
- Arora, S. & Borak, R. (2009). Computational Complexity: A Modern Approach. ISBN: 9780511804090.
I owe a lot to chapters 1 and 2 for their support for my bachelor's thesis (a short literature review on Complexity Theory). What stuck me around is it is one of the few introductory texts on NP-completeness that showcase methods of showing P is not equal to NP. It is strange that more books don't show this, as it's often the assumption amongst computer scientists that this is the case.
- Minsky, M. (1967). Computation: Finite and Infinite Machines*. ISBN: 9780131655638.
- Hopcroft, J., Motwani, R., & Ullman, J. (2013). Introduction to Automata Theory, Languages and Computation. ISBN: 9780321476173.
I am a mathematics student with very little education in computer science, and both of these books have been fantastic at introducing me to the world of Automata Theory.
Algebraic Topology and Algebraic Geometry
- Hatcher, A. (2002). Algebraic Topology. ISBN: 0521795400.
This book was the recommended reading for an algebraic topology course I took recently, and after the exam I have decided to continue reading it as Hatcher provides a fantastic outlook on the subject. If you are interested in algebraic topology I highly recommend reading this book.
- Hatcher, A. (2022). Topology of Numbers. ISBN: 9781470456115.
Unfortunately I started getting into algebraic geometry occured at the same time as my exams commencing, so I have not had much time to peruse the literature - however this has provided a fascinating outlook on geometric number theory that has been approachable enough for me to look at in my spare time when I revise.
Statistical Learning