Repository | Book | Chapter
(1987) Mathematical logic and its applications, Dordrecht, Springer.
The notion of prime computability on abstract (unordered) domains is introduced by Moschovakis [1]. The prime computable functions are exactly those which are computable by means of deterministic (serial) procedures. In partial structures not every computable by means of nondeterministic (parallel) procedures function is prime computable. The aim of this paper is to give a generalization of the notion of prime computability in order to obtain the functions which are computable by means of parallel procedures.
Publication details
DOI: 10.1007/978-1-4613-0897-3_26
Full citation:
Soskov, I. N. (1987)., Prime computability on partial structures, in D. G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, pp. 341-350.
This document is unfortunately not available for download at the moment.