Zobrazeno 1 - 10 of 229 pro vyhledávání: '"Keng Meng Ng"'
3
Akademický článek
Foundations of Online Structure Theory II: The Operator Approach
Autor: Rod Downey, Alexander Melnikov, Keng Meng Ng
Publikováno v: Logical Methods in Computer Science, Vol Volume 17, Issue 3 (2021)
We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the input to be
Externí odkaz: https://doaj.org/article/9d1d7a616e754b6a94ffbaa010f7e937
Zobrazit plný text záznamu
5
Extensions of two constructions of Ahmad
Autor: Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya I. Soskova
Publikováno v: Computability. 11:269-297
In her 1990 thesis, Ahmad showed that there is a so-called “Ahmad pair”, i.e., there are incomparable Σ 2 0 -enumeration degrees a 0 and a 1 such that every enumeration degree x < a 0 is ⩽ a 1 . At the same time, she also showed that there is
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e196d78fdf796700c0be526c51737fd7
https://doi.org/10.3233/com-210380
Zobrazit plný text záznamu
6
Primitive recursive equivalence relations and their primitive recursive complexity
Autor: Nikolay, Bazhenov, Keng Meng Ng, Luca San Mauro, Sorbi, Andrea
Publikováno v: Computability. 11:187-221
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f454b1e7c9382852bd6e4af3316f8d
https://doi.org/10.3233/com-210375
Zobrazit plný text záznamu
9
A recursion theoretic foundation of computation over real numbers
Autor: Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang
Publikováno v: Journal of Logic and Computation. 31:1660-1689
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by Gödel (1931, 1934) and Kleene (1936, Math. Ann., 112, 727–742). We show that this cla
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2ea457da1ba520929424307f12c8dbe
https://doi.org/10.1093/logcom/exab042
Zobrazit plný text záznamu
10
Every Δ20 degree is a strong degree of categoricity
Autor: Barbara F. Csima, Keng Meng Ng
Publikováno v: Journal of Mathematical Logic. 22
A strong degree of categoricity is a Turing degree [Formula: see text] such that there is a computable structure [Formula: see text] that is [Formula: see text]-computably categorical (there is a [Formula: see text]-computable isomorphism between any
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7f7e7f4f37b28b42c34e8c2fa610264e
https://doi.org/10.1142/s0219061322500222
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje