1 problem

Let $G$ be a computable connected graph whose distance function is intrinsically $n$-approximable from above, where $n>0$. A function is $n$-approximable from above if it has an ap…