Geodesic
Computability by nondeterministic program and the Moschovakis search computability
Matematičeskie zametki, Tome 56 (1994) no. 1, pp. 149-152 
V. D. Solov'ev. Computability by nondeterministic program and the Moschovakis search computability. Matematičeskie zametki, Tome 56 (1994) no. 1, pp. 149-152. http://geodesic.mathdoc.fr/item/MZM_1994_56_1_a17/
@article{MZM_1994_56_1_a17,
     author = {V. D. Solov'ev},
     title = {Computability by nondeterministic program and the {Moschovakis} search computability},
     journal = {Matemati\v{c}eskie zametki},
     pages = {149--152},
     year = {1994},
     volume = {56},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1994_56_1_a17/}
}
TY  - JOUR
AU  - V. D. Solov'ev
TI  - Computability by nondeterministic program and the Moschovakis search computability
JO  - Matematičeskie zametki
PY  - 1994
SP  - 149
EP  - 152
VL  - 56
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MZM_1994_56_1_a17/
LA  - ru
ID  - MZM_1994_56_1_a17
ER  - 
%0 Journal Article
%A V. D. Solov'ev
%T Computability by nondeterministic program and the Moschovakis search computability
%J Matematičeskie zametki
%D 1994
%P 149-152
%V 56
%N 1
%U http://geodesic.mathdoc.fr/item/MZM_1994_56_1_a17/
%G ru
%F MZM_1994_56_1_a17

Voir la notice de l'article provenant de la source Math-Net.Ru

[1] Odifreddi P., Classical Recursion Theory, North-Holland, Amsterdam, 1989 | Zbl

[2] Platek R. A., Foundations of recursion theory, Ph. D. Thesis, Stanford University, 1966

[3] Fenstad J., General Recursion Theory, Springer-Verlag, Berlin, 1980

[4] Moschovakis Y. N., “Abstract first order computability. I; II”, Trans. Amer. Math. Soc., 138 (1969), 427–504 | DOI | MR | Zbl

[5] Friedman H., “Algorithmic procedures, generalized Turing algorithms and elementary recursion theory”, Logic Coll'69, North-Holland, 1971

[6] Moldestad J., Stoltenberg-Hansen V., Tucker J., “Finite algorithmic procedures and computation theories”, Math. Scand., 46 (1980), 77–94 | MR | Zbl

[7] Constable R., Gries D., “On classes of program schemata”, SIAM comput., 1 (1972), 66–118 | DOI | MR | Zbl

[8] Gordon C. S., “Prime and search computability, characterized as definability in certain sublanguages of constructible $L_{\omega,\omega }$”, Trans. Amer. Math. Soc., 197 (1974), 391–408 | DOI | MR