Prime Computability on Partial Structures

Ivan N. Soskov
Additional contact information
Ivan N. Soskov: Sofia University, Laboratory of Computer Science

A chapter in Mathematical Logic and Its Applications, 1987, pp 341-350 from Springer

Abstract: 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.

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_26

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_26

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().