Keng Meng Ng

Algebraic structures computable without delay

I. Sh. Kalimullin, Alexander Melnikov, Keng Meng Ng · Theoretical Computer Science · 2017 · 64 citations

Engineering, Algebraic Structure, Computational Model Theory +5

UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

Uri Andrews, Steffen Lempp, Joseph S. Miller et al. · Journal of Symbolic Logic · 2014 · 61 citations

Equivalence Relation, Engineering, Universal Ceers +10

AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

Nikolay Bazhenov, Matthew Harrison‐Trainor, I. Sh. Kalimullin et al. · Journal of Symbolic Logic · 2019 · 28 citations · Full text

Engineering, Algebraic Structure, Automatic Structure +17

COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM

Matthew Harrison‐Trainor, Alexander Melnikov, Keng Meng Ng · Journal of Symbolic Logic · 2020 · 27 citations

Stone Duality, Set-theoretic Topology, Ordered Group +5

Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets

Johanna N. Y. Franklin, Noam Greenberg, Joseph S. Miller et al. · Proceedings of the American Mathematical Society · 2012 · 26 citations · Full text

Measure Theory, Engineering, Computable Probability Space +12