|
Oracle Programming in a Higher Level Language
R. V. Ganova Altai State Technical University
Abstract:
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.
Key words:
admissible refusals, embodiment, search machine, free regime, selector, command-declaration, higher level language.
Received: 01.01.1998
Citation:
R. V. Ganova, “Oracle Programming in a Higher Level Language”, Mat. Tr., 1:1 (1998), 29–53; Siberian Adv. Math., 8:2 (1998), 49–69
Linking options:
https://www.mathnet.ru/eng/mt132 https://www.mathnet.ru/eng/mt/v1/i1/p29
|
Statistics & downloads: |
Abstract page: | 195 | Full-text PDF : | 107 | First page: | 1 |
|