Takip et
Selwyn Keng Meng Ng
Selwyn Keng Meng Ng
Professor of Mathematics, Nanyang Technological University
ntu.edu.sg üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
862014
Algebraic structures computable without delay
I Kalimullin, A Melnikov, KM Ng
Theoretical Computer Science 674, 73-98, 2017
802017
Difference randomness
J Franklin, KM Ng
Proceedings of the American Mathematical Society 139 (1), 345-360, 2011
662011
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
512012
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
402019
Computable structures and operations on the space of continuous functions
AG Melnikov, KM Ng
Fund. Math 233 (2), 101-141, 2016
382016
Computability of Polish spaces up to homeomorphism
M Harrison-Trainor, A Melnikov, KM Ng
The Journal of Symbolic Logic 85 (4), 1664-1686, 2020
352020
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
352014
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
322015
Counting the changes of random∆ 0 2 sets
S Figueira, D Hirschfeldt, JS Miller, KM Ng, A Nies
32*2010
Foundations of online structure theory II: The operator approach
R Downey, A Melnikov, KM Ng
Logical Methods in Computer Science 17, 2021
302021
The importance of Π10 classes in effective randomness
G Barmpalias, AEM Lewis, KM Ng
The Journal of Symbolic Logic 75 (1), 387-400, 2010
282010
The diversity of categoricity without delay
IS Kalimullin, AG Melnikov, KM Ng
Algebra and Logic 56 (2), 171-177, 2017
242017
Turing degrees in Polish spaces and decomposability of Borel functions
V Gregoriades, T Kihara, KM Ng
Journal of Mathematical Logic 21 (01), 2050021, 2021
22*2021
The back-and-forth method and computability without delay
AG Melnikov, KM Ng
Israel Journal of Mathematics 234, 959-1000, 2019
222019
On strongly jump traceable reals
KM Ng
Annals of Pure and Applied Logic 154 (1), 51-69, 2008
202008
Online presentations of finitely generated structures
N Bazhenov, I Kalimullin, A Melnikov, KM Ng
Theoretical Computer Science 844, 195-216, 2020
192020
Bounded randomness
P Brodhead, R Downey, KM Ng
International Conference on Teaching and Computational Science, 59-70, 2012
172012
On the degree structure of equivalence relations under computable reducibility
KM Ng, H Yu
16*2019
Enumeration degrees and non-metrizable topology
T Kihara, KM Ng, A Pauly
arXiv preprint arXiv:1904.04107, 2019
162019
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20