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.