In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of informati...
Pilar Albert, Elvira Mayordomo, Philippe Moser, Sy...
This paper is concerned with the mathematics and formal specification of "set-like" operations for the mixed dimension cellular objects of the Djinn Application Programm...
Alan E. Middleditch, Chris Reade, Abel J. P. Gomes
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...