Alexander Melnikov (academic)

Alexander G. "Sasha" Melnikov is a Russian-born mathematician whose work centres on computability theory and its applications to algebra, topology and analysis. He is an Associate Professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand.^[1]

Melnikov earned a BSc (2006) and MSc (2008) in mathematics from Novosibirsk State University. He then obtained two doctoral qualifications: a Candidate of Sciences (C.Sc., 2012) from Novosibirsk State University on effective properties of decomposable abelian groups, and a PhD in computer science (2013) from the University of Auckland with the dissertation Computability and Structure, supervised by Bakhadyr Khoussainov and Andre Nies.^[2] In 2019 he was awarded a Doctor of Sciences (D.Sc.) by the Sobolev Institute of Mathematics for work on classification problems and constructive models.^[2]

After postdoctoral posts at Nanyang Technological University (2012–2013), Victoria University of Wellington (2013–2014), and the University of California, Berkeley (2014–2015), Melnikov joined Massey University as a Lecturer in 2015, was promoted to Senior Lecturer in 2017 and to Associate Professor in 2021.^[2] Later in 2021 he returned to Victoria University of Wellington, where he now teaches algebra and logic and leads research in computable mathematics.^[3]

Melnikov’s research focuses on computability-theoretic classification problems in algebraic, topological and analytical structures. He has solved several longstanding open problems in the field, including problems of Goncharov and of Goncharov and Knight that became the foundation of his DSc dissertation Classification problems and constructive models, a problem of Khoussainov and Nerode on the classification of polynomial-time and automatic structures,^[4] and, jointly with Keng Meng Ng, a 60-year-old problem of Mal’cev concerning computable torsion abelian groups,^[5] the latter recognised by the Kalman Prize of the New Zealand Mathematical Society. His broader contributions include the development of the theory of recursive abelian groups, computably compact metric spaces, the introduction of punctual structures (with Kalimullin and Ng), and the recent monograph Computable Structure Theory: A Unified Approach (with Rodney G. Downey, Springer, 2025), which consolidates much of modern work in the area.

• Rutherford Discovery Fellowship (Royal Society Te Apārangi, 2019–2024) for the project “Applications of modern computability”.^[6]
• NZMS Early Career Research Award (New Zealand Mathematical Society, 2016) for highly original contributions to computability in algebra and topology.^[7]
• Massey University Early Career Research Medal (2017).^[8]
• Kalman Prize for Best Paper (New Zealand Mathematical Society, 2019) for the paper Computable torsion abelian groups (Advances in Mathematics), co-authored with Keng Meng Ng.^[9]

• Downey, Rodrney; Melnikov, Alexander G. (2013). "Effectively categorical abelian groups". Journal of Algebra. 373: 223–248. doi:10.1016/j.jalgebra.2012.09.020.
• Melnikov, Alexander G. (2014). "Computable abelian groups". Bulletin of Symbolic Logic. 20 (3): 315–356. doi:10.1017/bsl.2014.32. JSTOR 23927281.
• Melnikov, Alexander G.; Ng, Keng Meng (2018). "Computable Torsion Abelian Groups". Advances in Mathematics. 332: 126–164. doi:10.1016/j.aim.2017.12.011.
• Bazhenov, Nikolay; Harrison-Trainor, Matthew; Kalimullin, Iskander; Melnikov, Alexander G.; Ng, Keng Meng (2019). "Polynomial-Time and Automatic Structures". Journal of Symbolic Logic. 84 (4): 1306–1331. doi:10.1017/jsl.2019.26.
• Harrison-Trainor, Matthew; Melnikov, Alexander G.; Ng, Keng Meng (2020). "Computability of Polish spaces up to homeomorphism". Journal of Symbolic Logic. 85 (4): 1664–1686. doi:10.1017/jsl.2020.67.