NG Keng Meng

NG Keng Meng is a Professor and Associate Chair (Academic) at Nanyang Technological University, School of Physical and Mathematical Sciences, Department of Mathematics. His research interests include computability theory, descriptive and algorithmic complexity, algorithmic information theory and randomness, and reverse mathematics. He holds a PhD from Victoria University of Wellington and is affiliated with the university's mathematics department. His profile and contact details are available on the faculty page of the School of Physical and Mathematical Sciences.

Selwyn Keng Meng Ng is a Professor of Mathematics at Nanyang Technological University, specializing in Mathematical Logic, Algorithmic Randomness, and Computability Theory. His research explores the interplay between computability and randomness, focusing on algebraic structures, equivalence relations, and the foundations of online structure theory. He investigates properties of Martin-Löf random points, effectively closed sets, and the complexity of equivalence relations under computable reducibility. His work also addresses the categoricity of structures, the role of Π1 0 classes in effective randomness, and the computability of Polish spaces. Ng's contributions highlight the connections between algorithmic randomness, computable structures, and the logical foundations of mathematics.