Search computability and computability with numberings are equivalent in the case of finite set of objects
pp. 233-242
in: Dimiter G. Skordev (ed), Mathematical logic and its applications, Berlin, Springer, 1987Abstrakt
In the paper [1] Moschovakis has defined a concept about relative computability, which he called search computability. D. Skordev has defined another concept about relative computabi1ity, which he called admissibility. That concept is connected with partial recursivness. Similar definition of admissibility has been given by Lacombe [2], which he called ∀-recursiveness.