The purpose of this paper is to give a brief survey the implications of the theories of modern physics for the doctrine of determinism. The survey will reveal a curious feature of determinism: in some respects it is fragile, requiring a number of enabling assumptions to give it a fighting chance; but in other respects it is quite robust and very difficult to kill. The survey will also aim to sh...

We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) combines aspects of the quantum circuit [1] and the one-way model [2] to overcome challenging issues in building large-scale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed two-qubit interaction to couple th...

In this paper we define a non-deterministic dynamic neighborhood model. As a special case, a linear neighborhood model is considered. When a non-deterministic neighborhood model functions, it is possible to introduce a restriction on the number of active layers, which will allow the variation of the non-determinism of the model at each moment of time. We give the notion of the non-determinacy m...

Non-determinism arises naturally in many real-world applications of action planning. Strong plans for this type of problems can be found using AO* search guided by an appropriate heuristic function. Most domain-independent heuristics considered in this context so far are based on the idea of ignoring delete lists and do not properly take the non-determinism into account. Therefore, we investiga...

This abstract presents the initial results of exploring the notion of non-determinism in representing nursing intuition via type-2 fuzzy sets.

We investigate proving properties of Curry programs using Agda. First, we address the functional correctness of Curry functions that, apart from some syntactic and semantic differences, are in the intersection of the two languages. Second, we use Agda to model non-deterministic functions with two distinct and competitive approaches incorporating the non-determinism. The first approach eliminate...

In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict functions. Therefore, equational reasoning is not valid for deriving properties of such programs. In a previous work we showed how a mapping from CRWL –a well known logical framework for functional logic programming– into ...