|Asst Prof Ng Keng Meng |
Division of Mathematical Sciences
School of Physical & Mathematical Sciences
College of Science
- PhD in Mathematics Victoria University of Wellington 2009
- MSc in Mathematics National University of Singapore 2005
- BSc in Mathematics (Hons) National University of Singapore 2003
|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.|
|Research Grant |
- Academic Research Fund Tier 2 (2011-)
- Start Up Grant (2011-)
|Current Projects |
- Applied Computability Theory and Effective
- On the Algebraic Structure of Computably Enumerable Turing Degrees
- Johanna N.Y. Franklin, Noam Greenberg, Joseph S. Miller and Keng Meng Ng. (2012). Martin-Lof random points satisfy Birkhoff's ergodic theorem for effectively closed sets. Proceedings of the American Mathematical Society, To appear.
- Paul Brodhead, Rod Downey and Keng Meng Ng. (2012). Bounded randomness. Workshop on Theoretical Computer Science.
- Barbara Csima, Rod Downey and Keng Meng Ng. (2011). Limits on jump inversion for strong reducibilities. Journal of Symbolic Logic, 76(4), 1287-1296.
- David Diamondstone and Keng Meng Ng. (2011). Strengthening prompt simplicity. Journal of Symbolic Logic, 76(3), 946-972.
- Johanna N.Y. Franklin and Keng Meng Ng. (2011). Difference randomness. Proceedings of the American Mathematical Society, 139, 345-360.