In this script of Lou van den Dries I encountered (total) functions $\mathbb N^n\to\mathbb N$ and relations $R\subseteq\mathbb N^n$ that are marked as computable.
They are introduced in section 5.1. on page 82.
Addition, multiplication, coördinate functions and relation $\leq$ are computable by definition and further the collection is closed under composition and a minimalisation restricted in such a way that it does not produce undefined values.
My question is the following:
If $R_n\subseteq\mathbb N$ is computable for every $n\in\mathbb N$ and $R\subseteq\mathbb N$ is defined as: $R(a)\iff\exists n<a[R_n(a)]$ then is $R$ computable?
If I look at it only on intuition then I would expect the answer to my question to by "yes". For a fixed $a$ we just have to check for a finite ($n<a$) number of algorithms whether they confirm or deny $R_n(a)$.
But intuition has deceived me many times and am eager to find a real proof (or counterexample).
Thank you very much for taking notice of this question.