There is a deeply entrenched view in philosophy and physics, the closed systems view, according to which isolated systems are conceived of as fundamental. On this view, when a system is under the influence of its environment this is described in terms of a coupling between it and a separate system which taken together are isolated. We argue against this view, and in favor of the alternative open systems view, for which systems interacting with their environment are conceived of as (...) fundamental, and the environment's influence is represented via the dynamical equations that govern the system's evolution. Taking quantum theories of closed and open systems as our case study, and considering three alternative notions of fundamentality: (i) ontic fundamentality, (ii) epistemic fundamentality, and (iii) explanatory fundamentality, we argue that the open systems view is fundamental, and that this has important implications for the philosophy of physics, the philosophy of science, and for metaphysics. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...) other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

In what sense are the special sciences autonomous of fundamental physics? Autonomy is an enduring theme in discussions of the relationship between the special sciences and fundamental physics or, more generally, between higher and lower-level facts. Discussion of ‘autonomy’ often fails to recognise that autonomy admits of degrees; consequently, autonomy is either taken to require full independence, or risk relegation to mere apparent autonomy. In addition, the definition of autonomy used by Fodor, the most famous proponent of the autonomy of (...) the special sciences, has been robustly criticised by Loewer. In this paper I develop a new account of autonomy following Woodward which I dub ‘generalised autonomy’ since it unifies dynamical, causal and nomic autonomy. Autonomy, on this account, can be partial: some lower-level details matter while others do not. To summarise: whilst the detailed lower level is unconditionally relevant, conditionalising on the higher-level facts renders some lower-level details irrelevant. The macrodependencies that the higher-level facts enter into — be they dynamical, causal or nomic — screen off the underlying microdetails. This account helps resolve an explanatory puzzle: if the lower-level facts in some way underpin the higher-level facts, why don’t the lower-level details matter more for the day-to-day practice of the special sciences? The answer will be: the facts uncovered by the special sciences are autonomous in my sense, and so practitioners of these special sciences need not study more fundamental sciences, since these underlying facts are genuinely irrelevant. (shrink)

Determinism, causality, chance, free will and divine providence form a class of interlaced problems lying in three domains: philosophy, theology, and physics. Recent article by Dariusz Łukasiewicz in Roczniki Filozoficzne (no. 3, 2020) is a great example. Classical physics, that of Newton and Laplace, may lead to deism: God created the world, but then it goes like a mechanical clock. Quantum mechanics brought some “hope” for a rather naïve theology: God acts in gaps between quanta of indetermination. Obviously, any strict (...) determinism jeopardizes the existence of free will. Yes, but only if human mind follows the laws of physics and only if nothing exists outside the physical limits of space and time. We argue that human action lies in-between two worlds: “earth” and “heavens” using the language of Genesis. In that immaterial world, outside time and space constraints, there is no place for the chain of deterministic events. We discuss, in turn, that the principle of causality, a superior law even in physics, reigns also in the non-material world. Though, determinism in the material universe and causality in both worlds seem to be sufficient conditions, to eliminate “chaotic”, or probabilistic causes from human (and divine) action. (shrink)

Putnam coined what is now known as the no miracles argument “[t]he positive argument for realism”. In its opposition, he put an argument that by his own standards counts as negative. But are there no positive arguments against scientific realism? I believe that there is such an argument that has figured in the back of much of the realism-debate, but, to my knowledge, has nowhere been stated and defended explicitly. This is an argument from the success of quantum physics to (...) the unlikely appropriateness of scientific realism as a philosophical stance towards science. I will here state this argument and offer a detailed defence of its premises. The purpose of this is to both exhibit in detail how far the intuition that quantum physics threatens realism can be driven, in the light also of more recent developments, as well as to exhibit possible vulnerabilities, i.e., to show where potential detractors might attack. (shrink)