Oracle Programming in a~Higher Level Language
Matematičeskie trudy, Tome 1 (1998) no. 1, pp. 29-53
Voir la notice de l'article provenant de la source Math-Net.Ru
The present article is most likely of a “reconnaissance character”. We examine abstract computations with unary oracles in the availability of admissible refusals. Studying the problem, we single out a “higher level language” whose peculiarity is command-declarations. A dominant role in this computing situation belongs to “search” machines reckoning machine embodiments in the process of inductive construction of oracles.
@article{MT_1998_1_1_a1,
author = {R. V. Ganova},
title = {Oracle {Programming} in {a~Higher} {Level} {Language}},
journal = {Matemati\v{c}eskie trudy},
pages = {29--53},
publisher = {mathdoc},
volume = {1},
number = {1},
year = {1998},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MT_1998_1_1_a1/}
}
R. V. Ganova. Oracle Programming in a~Higher Level Language. Matematičeskie trudy, Tome 1 (1998) no. 1, pp. 29-53. http://geodesic.mathdoc.fr/item/MT_1998_1_1_a1/