The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming
نویسندگان
چکیده
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice. Cons-freeness roughly means that data constructors cannot occur in function bodies and all manipulation of storage space thus has to happen indirectly using the call stack. While cons-free programs have previously been used by several authors to characterise complexity classes, the work on non-deterministic programs has almost exclusively considered programs of data order 0. Previous work has shown that adding explicit non-determinism to consfree programs taking data of order 0 does not increase expressivity; we prove that this—dramatically—is not the case for higher data orders: adding non-determinism to programs with data order at least 1 allows for a characterisation of the entire class of elementary-time decidable sets. Finally we show how, even with non-deterministic choice, the original hierarchy of characterisations is restored by imposing different restrictions.
منابع مشابه
Complexity Hierarchies and Higher-order Cons-free Term Rewriting
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuition is that rules cannot build new data structures. In programming language research, cons-free languages have been used to characterize hierarchies of computational complexity classes; in term rewriting, cons-free fi...
متن کاملComplexity Hierarchies and Higher-Order Cons-Free Rewriting
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the righthand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data structures. It is well-known that cons-free programming languages can be used to characterize computational complexity classes, and that cons-free first-order...
متن کاملAn Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
We define the class of constrained cons-free rewriting systems and show that this class characterizes P , the set of languages decidable in polynomial time on a deterministic Turing machine. The main novelty of the characterization is that it allows very liberal properties of term rewriting, in particular non-deterministic evaluation: no reduction strategy is enforced, and systems are allowed t...
متن کاملGeneralized Implicit Definitions on Finite Structures
We propose a natural generalization of the concept of implicit deenitions over nite structures, allowing non-determinism at an intermediate level of a (deterministic) deenition. These generalized implicit deenitions ooer more expressive power than classical implicit dee-nitions. Moreover, their expressive power can be characterized over un-ordered nite structures in terms of the complexity clas...
متن کاملGeneralized Implicit De nitions on Finite Structures
We propose a natural generalization of the concept of im plicit de nitions over nite structures allowing non determinism at an intermediate level of a deterministic de nition These generalized im plicit de nitions o er more expressive power than classical implicit de nitions Moreover their expressive power can be characterized over un ordered nite structures in terms of the complexity class NP ...
متن کامل