Follow
Selwyn Keng Meng Ng
Selwyn Keng Meng Ng
Associate Professor of Mathematics, Nanyang Technological University
Verified email at ntu.edu.sg - Homepage
Title
Cited by
Cited by
Year
Universal computably enumerable equivalence relations
U Andrews, S Lempp, JS Miller, KM Ng, L San Mauro, A Sorbi
The Journal of Symbolic Logic 79 (1), 60-88, 2014
682014
Difference randomness
J Franklin, KM Ng
Proceedings of the American Mathematical Society 139 (1), 345-360, 2011
642011
Algebraic structures computable without delay
I Kalimullin, A Melnikov, KM Ng
Theoretical Computer Science 674, 73-98, 2017
482017
Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
J Franklin, N Greenberg, J Miller, KM Ng
Proceedings of the American Mathematical Society 140 (10), 3623-3628, 2012
472012
Complexity of equivalence relations and preorders from computability theory
E Ianovski, R Miller, KM Ng, A Nies
The Journal of Symbolic Logic 79 (3), 859-881, 2014
322014
Counting the changes of random∆ 0 2 sets
S Figueira, D Hirschfeldt, JS Miller, KM Ng, A Nies
32*2010
An analogy between cardinal characteristics and highness properties of oracles
J Brendle, A Brooke-Taylor, KM Ng, A Nies
Proceedings of the 13th Asian Logic Conference, 1-28, 2015
302015
Computable structures and operations on the space of continuous functions
AG Melnikov, KM Ng
Fund. Math 233 (2), 101-141, 2016
282016
The importance of Π10 classes in effective randomness
G Barmpalias, AEM Lewis, KM Ng
The Journal of Symbolic Logic 75 (1), 387-400, 2010
262010
Automatic and polynomial-time algebraic structures
N Bazhenov, M Harrison-Trainor, I Kalimullin, A Melnikov, KM Ng
The Journal of Symbolic Logic 84 (4), 1630-1669, 2019
252019
On strongly jump traceable reals
KM Ng
Annals of Pure and Applied Logic 154 (1), 51-69, 2008
182008
Bounded randomness
P Brodhead, R Downey, KM Ng
International Conference on Teaching and Computational Science, 59-70, 2012
172012
The diversity of categoricity without delay
IS Kalimullin, AG Melnikov, KM Ng
Algebra and Logic 56 (2), 171-177, 2017
162017
On the degree structure of equivalence relations under computable reducibility
KM Ng, H Yu
Notre Dame Journal of Formal Logic 60 (4), 733-761, 2019
132019
The back-and-forth method and computability without delay
AG Melnikov, KM Ng
Israel Journal of Mathematics 234 (2), 959-1000, 2019
132019
Computable torsion abelian groups
AG Melnikov, KM Ng
Advances in Mathematics 325, 864-907, 2018
132018
Abelian p-groups and the halting problem
R Downey, AG Melnikov, KM Ng
Annals of Pure and Applied Logic 167 (11), 1123-1138, 2016
132016
Jump inversions inside effectively closed sets and applications to randomness
G Barmpalias, R Downey, KM Ng
The Journal of Symbolic Logic 76 (2), 491-518, 2011
132011
Foundations of online structure theory II: The operator approach
KM Ng, A Melnikov, R Downey
Logical Methods in Computer Science 17, 2021
122021
Enumeration degrees and non-metrizable topology
T Kihara, KM Ng, A Pauly
arXiv preprint arXiv:1904.04107, 2019
102019
The system can't perform the operation now. Try again later.
Articles 1–20