2 papers
cs.LO2020
A recursion theoretic foundation of computation over real numbers
Keng Meng Ng, Nazanin R. Tavana, Yue Yang
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 and Kleene.…
math.GN2019
Enumeration degrees and non-metrizable topology
Takayuki Kihara, Keng Meng Ng, Arno Pauly
The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0…