Repository | Book | Chapter
Search computability and computability with numberings are equivalent in the case of finite set of objects
pp. 233-242
Abstract
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.
Publication details
Published in:
Skordev Dimiter G (1987) Mathematical logic and its applications. Dordrecht, Springer.
Pages: 233-242
DOI: 10.1007/978-1-4613-0897-3_15
Full citation:
Ditchev Angel V. (1987) „Search computability and computability with numberings are equivalent in the case of finite set of objects“, In: D.G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, 233–242.