activity
20182021
most citedThe Strength of Ramsey's Theorem For Pairs over trees: I. Weak König's Lemma

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

collaborators
Showing cs.LOShow all

1 paper · 1 filter

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.…