Search results for "computational complexity."
showing 5 items of 245 documents
A Neuro-Ethological Approach for the TSP: Changing Metaphors in Connectionist Models.
1994
Biological systems often offer solutions to difficult problems which are not only original but also efficient. Connectionist models have been inspired by neural systems and successfully applied to the formulation of algorithms for solving complex problems such as the travelling salesman problem. In this paper we extend the connectionist metaphor to include an ethological account of how problems similar to the travelling salesman problem are solved by real living systems. A model is presented in which a population of neural networks with simple sensory-motor systems evolve genetically in simulated environments which represent the problem instances to be solved. Preliminary results are discu…
Varieties Generated by Certain Models of Reversible Finite Automata
2006
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.
The Syllogistic with Unity
2011
We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.
Logic and the Myth of the Perfect Language
2010
We argue that the dream of a ‘perfect language’ – namely, a universal, unambiguous and semantically transparent medium of expression –, whose intriguing story has been told by Umberto Eco (1993), is deeply intertwined with the myth of instant rationality: the idea that a perfect language is one in which all logical relations becomeimmediatly visible, so that the language itself “does the thinkingfor us” (Frege 1884). In the first part of this paper we trace this versionof the dream in the works of Leibniz, Frege, Russell and Wittgenstein. In the second part we re-examine it in the light of more recent negative results in logic and theoretical computer science.
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
2014
In the paper we investigate a model for computing of Boolean functions - Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. - We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k+1. - We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficien…