Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types
نویسندگان
چکیده
D We investigate the notion of “semicomputability,” intended to generalize the notion of recursive enumerability of relations to abstract structures. Two characterizations are considered and shown to be equivalent: one in terms of “ partial computable functions’ ’ (for a suitable notion of computability over abstract structures) and one in terms of definability by means of Horn programs over such structures. This leads to the formulation of a “Generalized Church-Turing Thesis” for definability of relations on abstract structures. a
منابع مشابه
Linear Logic Automata
A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic. A programming language of LL automata is developed in which typical sequential, nondeterministic and parallel programming ...
متن کاملUniversality and semicomputability for nondeterministic programming languages over abstract algebras
The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who proved the existence of a universal Turing machine for computations on strings over a finite alphabet. This stimulated the development of stored-program computers. Classical computability theory, including the UFT and the theory of semicomputable sets, has been extended by Tucker and Zucker to abstract ma...
متن کاملSetac: A Framework for Phased Deterministic Testing of Scala Actor Programs
Scala provides an actor library where computation entities, called actors, communicate by exchanging messages. The schedule of message exchanges is in general nondeterministic. Testing non-deterministic programs is hard, because it is necessary to ensure that the system under test has executed all important schedules. Setac is our proposed framework for testing Scala actors that (1) allows prog...
متن کاملPolymorphic Type Analysis in Logic Programs by Abstract Interpretation1
domains and their associated abstract operators. Some examples are to be found in [6, 22, 24, 27, 28]. Most type analysis systems infer descriptive types. A descriptive type is a description of a set of terms by an expression in a type language. Different type analysis systems may use different type languages. Most of them use regular types or deterministic regular types [16] in one form or ano...
متن کاملOn Limited versus Polynomial Nondeterminism
In this paper, we show that efficient algorithms for some problems Abstract-1 that require limited nondeterminism imply the subexponential simulation of nondeterministic computation by deterministic computation. In particular, if cliques of size O(logn) can be found in polynomial time, then nondeterministic time f(n) is contained in deterministic time 2O( √ f(n) polylog f(n)).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 13 شماره
صفحات -
تاریخ انتشار 1992