Keng-Meng Ng

activity

20202026

most citedFoundations of Online Structure Theory II: The Operator Approach

7 citations · 7 across the 3 of their papers we have counts for

collaborators

3 papers

math.LO2026

Conjunctive reducibilities and completeness

Irakli Chitaia, Keng Meng Ng, Roland Omanadze +1

In this article we study the notion of completeness for conjunctive reducibilities. We investigate the relationship between $c$ -completeness and $r$ -completeness of computably enum…

math.LO2022

Limit Complexities, Minimal Descriptions, and $n$ -Randomness

Rodney Downey, Lu Liu, Keng Meng Ng +1

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^{A}$ denote it relative to an oracle $A$ . We show that for any $n$ , $K^{\emptyset^{(n)}}$ is definable purely in terms of the…

math.LO2020★ 7 cited

Foundations of Online Structure Theory II: The Operator Approach

Rod Downey, Alexander Melnikov, Keng Meng Ng

We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We sugg…

Conjunctive reducibilities and completeness

Limit Complexities, Minimal Descriptions, and n-Randomness

Foundations of Online Structure Theory II: The Operator Approach

Limit Complexities, Minimal Descriptions, and $n$ -Randomness