|Academic Profile |
| || |
Assoc Prof Ng Keng Meng
Associate Professor, School of Physical & Mathematical Sciences
|Dr. Ng received his BSc and MSc in Mathematics from NUS in 2003 respectively 2005, and his PhD in Mathematics from the Victoria University of Wellington in 2009. From 2009 to 2011 he worked as a Van Vleck Assistant Professor at the Department of Mathematics, University of Wisconsin-Madison.|
|Dr. Ng's main research interest is in computability theory, a branch of mathematical logic. He is interested in the theory of computation, particularly in descriptive and algorithmic complexity. He works in classical and applied computability theory, and in algorithmic information theory and randomness. He is also interested in reverse mathematics and the application of computability theory to combinatorics and analysis.|
- Applied Computability Theory and Effective
- On the Algebraic Structure of Computably Enumerable Turing Degrees
- The Algorithmic Aspects of Mathematical Structures and Randomness
- The Role of Algorithms in Discrete Mathematics
- The Theory of Computation and Applied Randomness
- Uri Andrews, Steffen Lempp, Joseph Miller, Luca San Mauro, Keng Meng Ng, Andrea Sorbi. (2013). Universal computably enumerable equivalence relations. The Journal of Symbolic Logic, .
- Johanna Franklin, Keng Meng Ng. (2013). w-r.e. randomness. The Journal of Symbolic Logic, .
- Egor Ianofski, Russell Miller, Andre Nies, Keng Meng Ng. (2013). Complexity of equivalence relations and preorders from computability theory. The Journal of Symbolic Logic, .
- Andre Nies, Keng Meng Ng and Frank Stephan. (2013). Random sets and recursive splittings. Computability, .
- Rod Downey, Keng Meng Ng. (2013). Lowness for Bounded Randomness. Theoretical Computer Science, 460(C), 1-9.
« Back to Category Write-up