molavi's theological and mystical point of view on determinism is different. he criticizes of theological determinism, but advocates of mystical determinism. molavi refuses the determinists' belief about determinism because it has unfavorable results in worldly and eternal life. but he accepts the free and amorous determinism of mystics. his reasons in refusing theological determinism...

Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and resilience against intrusions of computing systems. However, redundant execution systems rely on the premise that when external input is duplicated identically to a set of replicas executing the same program, the replicas...

Constraint programming has been proved as an excellent tool to solve combinatori-al problems in many application areas. Through constraint propagation large parts of the search space can be pruned away. Hard problems are those which involve disjunc-tive constraints introducing non-determinism. While the introduction of choice-points for disjunctive constraints may lead to combinatorial explosio...

We study hyper transition systems as a formalism to give semantics to speciication languages which support both unbounded angelic and unbounded demonic non-determinism as well as recursion. Hy-per transition are a generalization of transition systems and are suited for the speciication of computations by means of properties that atomic steps in a computation have to satisfy. As an application w...

The traditional overlap between computer science and philosophy centres upon the issue of in what sense a computer may be said to think. A lesser known issue of potential common interest is the ontology of the semantics computer science assigns to programming languages such as Pascal or Java. We argue that the usual purely mathematical approach of denotational semantics necessarily excludes imp...

We extend the notion of quantum information flow defined by Danos and Kashefi [1] for the one-way model [2] and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the (X,Y ), (X,Z) and (Y, Z) planes. We apply both measurement calculus and the stabiliser formalism to derive our...

Computing the constant Z that normalizes an arbitrary distribution into a probability distribution is a difficult problem that has applications in statistics, biophysics and probabilistic reasoning. In biophysics, it is a prerequisite for the computation of the binding affinity between two molecules, a central question for protein design. In the case of a discrete stochastic Graphical Model, th...

When developing the speciications of computer system components, it is often necessary or desirable to include non{deterministic behavior into the speciication. Unfortunately this non{determinism can cause diiculty when we try to verify properties of the specii-cation. In this paper we present a method for modelling non{determinism in a way that allows the veriier to isolate it from other aspec...

The Self-Modifying Finite Automaton (SMFA) is a model of computation introduced in [RS93, RS94, RS95b]. Formal de nitions appear in [RS95a]. This paper further investigates the computational power of the model, and introduces the concepts of path determinism and register complexity.

For each natural number d we consider a finite structure Md whose universe is the set of all 0, 1-sequence of length n = 2d, each representing a natural number in the set {0, 1, ..., 2n − 1} in binary form. The operations included in the structure are the constants 0, 1, 2n − 1, n, multiplication and addition modulo 2n, the unary function min{2x, 2n − 1}, the binary functions bx/yc, max(x, y), ...