The investigation of probabilistic causality has been plagued by a variety of misconceptions and misunderstandings. One has been the thought that the aim of the probabilistic account of causality is the reduction of causal claims to probabilistic claims. Nancy Cartwright (1979) has clearly rebutted that idea. Another ill-conceived idea continues to haunt the debate, namely the idea that context...

Tim Maudlin’s argument for the inconsistency of Cramer’s Transactional Interpretation (TI) of quantum theory has been considered in some detail by Joseph Berkovitz, who has provided a possible solution to this challenge at the cost of a significant empirical lacuna on the part of TI. The present paper proposes an alternative solution in which Maudlin’s charge of inconsistency is evaded but at n...

Although Plotkin’s parallel-or is inherently deterministic, it has a non-deterministic interpretation in games based on (prime) event structures – in which an event has a unique causal history – because they do not directly support disjunctive causality. General event structures can express disjunctive causality and have a more permissive notion of determinism, but do not support hiding. We sho...

It is currently believed that the local causality of Quantum Field Theory (QFT) is destroyed by the measurement process. This belief is also based on the Einstein-Podolsky-Rosen (EPR) paradox and on the so-called Bell’s theorem, that are thought to prove the existence of a mysterious, instantaneous action between distant measurements. However, I have shown recently that the EPR argument is remo...

Byrne and Hall (1999) criticized the argument of Chalmers (1996) in favor of the Everett-style interpretation. They claimed to show “the deep and underappreciated flaw in any Everett-style interpretation”. I will argue that it is possible to interpret Chalmers’s writing in such a way that most of the criticism by Byrne and Hall does not apply. In any case their general criticism of the many-wor...

This paper investigates a new model that takes advantage of the cooperative self-organization of Ant Algorithms to evolve a naturally inspired pattern recognition (and also clustering) method. The approach considers each data item as an ant that changes the environment as it moves through it. The algorithm is successfully applied to well-known classification problems and yields better results t...