George Barmpalias

George Barmpalias is a Professor at the Chinese Academy of Sciences (Institute of Software), with a research focus on Mathematical Logic, Computability Theory, Algorithmic Randomness, and Kolmogorov Complexity. His work also extends to Network Science and Social Dynamics through Schelling segregation models.

• Ph.D. in Mathematics, University of Leeds (2004)
• Mathematics Degree, University of Thessaloniki (2000)

Research Interests include:

• Algorithmic Randomness (Ω numbers, K-triviality, Martin-Löf randomness)
• Computability Theory (Turing degrees, reducibilities, effective closed sets)
• Network Dynamics (Schelling models, segregation tipping points, idemetric properties)
• Information Theory (Kolmogorov complexity, data compression, oracle use bounds)

Scientific Awards:

• Distinguished Research Professor (CAS, 2022)
• National Natural Science grants (2015-2020)
• International Young Scientist Award (CAS, 2012)
• EPSRC Research Fellowship (2004)

Teaching spans graduate courses in:

• Theory of Computation
• Network Science
• Mathematical Logic
• Computability and Randomness

Supervision includes Ph.D./MSc students like Fang Nan, Cheng Shichao, and Charlotte Vlek. His software projects include high-performance C++ simulations for Schelling models and open-source tools for algorithmic experiments.