karl bühler digital

Home > Edited Book > Contribution

Publication details

Publisher: Springer

Place: Berlin

Year: 1987

Pages: 341-350

ISBN (Hardback): 9781461282341

Full citation:

Ivan N. Soskov, "Prime computability on partial structures", in: Mathematical logic and its applications, Berlin, Springer, 1987

Abstract

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

Publisher: Springer

Place: Berlin

Year: 1987

Pages: 341-350

ISBN (Hardback): 9781461282341

Full citation:

Ivan N. Soskov, "Prime computability on partial structures", in: Mathematical logic and its applications, Berlin, Springer, 1987