Within the current mainstream research in the foundations of physics, much attention has been turned to the program of Axiomatic Reconstruction of Quantum Theory in terms of Information-Theoretic principles (ARQIT). ARQIT aims at finding a few general information-theoretic principles from which, once translated into mathematical terms, one can formally derive the structure of quantum theory. This chapter explores the role of mechanistic explanations and mathematical explanations (in particular, structural explanations) within ARQIT. With such considerations as a point of departure, we (...) investigate how ARQIT contributes to the explanation of quantum phenomena, and the possible prospects for explanations provided by mechanical interpretations of quantum theory. (shrink)

Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding our practical limits. In this chapter I argue that the science of \emph{quantum computing} illuminates complexity theory by emphasising that its fundamental concepts are not model-independent, but that this does not, as some suggest, force us to radically revise the foundations of the theory. For model-independence (...) never has been essential to those foundations. The fundamental aim of complexity theory is to describe what is achievable in practice under various models of computation for our various practical purposes. Reflecting on quantum computing illuminates complexity theory by reminding us of this, too often under-emphasised, fact. (shrink)

Perennial philosophers' hopes are unlikely victims of swift, natural deduction. Yet anti-realism has been thought one. Not hoping for anti-realism myself I here show it, lest it be underestimated, to survive the following argument, adapted from W. D.Hart pp. 156, 164-5; he credits first publication to Fitch).

Putnam (Representations and reality. MIT Press, Cambridge, 1988) and Searle (The rediscovery of the mind. MIT Press, Cambridge, 1992) famously argue that almost every physical system implements every finite computation. This universal implementation claim, if correct, puts at the risk of triviality certain functional and computational views of the mind. Several authors have offered theories of implementation that allegedly avoid the pitfalls of universal implementation. My aim in this paper is to suggest that these theories are still consistent with a (...) weaker result, which is the nomological possibility of systems that simultaneously implement different complex automata. Elsewhere I (Shagrir in J Cogn Sci, 2012) argue that this simultaneous implementation result challenges a computational sufficiency thesis (articulated by Chalmers in J Cogn Sci, 2012). My focus here is on theories of implementation. After presenting the basic simultaneous implementation construction, I argue that these theories do not avoid the simultaneous implementation result. The conclusion is that the idea that the implementation of the right kind of automaton suffices for a possession of a mind is dubious. (shrink)

This paper defends the naïve thesis that the method of experiment has per se an epistemic superiority over the method of computer simulation, a view that has been rejected by some philosophers writing about simulation, and whose grounds have been hard to pin down by its defenders. I further argue that this superiority does not come from the experiment’s object being materially similar to the target in the world that the investigator is trying to learn about, as both sides of (...) dispute over the epistemic superiority thesis have assumed. The superiority depends on features of the question and on a property of natural kinds that has been mistaken for material similarity. Seeing this requires holding other things equal in the comparison of the two methods, thereby exposing that, under the conditions that will be specified, the simulation is necessarily epistemically one step behind the corresponding experiment. Practical constraints like feasibility and morality mean that scientists do not often face an other-things- equal comparison when they choose between experiment and simulation. Nevertheless, I argue, awareness of this superiority and of the general distinction between experiment and simulation is important for maintaining motivation to seek answers to new questions. (shrink)

This paper defends the naïve thesis that the method of experiment has per se an epistemic superiority over the method of computer simulation, a view that has been rejected by some philosophers writing about simulation, and whose grounds have been hard to pin down by its defenders. I further argue that this superiority does not come from the experiment’s object being materially similar to the target in the world that the investigator is trying to learn about, as both sides of (...) dispute over the epistemic superiority thesis have assumed. The superiority depends on features of the question and on a property of natural kinds that has been mistaken for material similarity. Seeing this requires holding other things equal in the comparison of the two methods, thereby exposing that, under the conditions that will be specified, the simulation is necessarily epistemically one step behind the corresponding experiment. Practical constraints like feasibility and morality mean that scientists do not often face an other-things- equal comparison when they choose between experiment and simulation. Nevertheless, I argue, awareness of this superiority and of the general distinction between experiment and simulation is important for maintaining motivation to seek answers to new questions. (shrink)

A number of recent discussions comparing computer simulation and traditional experimentation have focused on the significance of “materiality.” I challenge several claims emerging from this work and suggest that computer simulation studies are material experiments in a straightforward sense. After discussing some of the implications of this material status for the epistemology of computer simulation, I consider the extent to which materiality (in a particular sense) is important when it comes to making justified inferences about target systems on the basis (...) of experimental results. (shrink)

Glaucon in Plato's _Republic_ fails to grasp intermediates. He confuses pursuing a goal with achieving it, and so he adopts ‘mathematical platonism’. He says mathematical objects are eternal. Socrates urges a seriously debatable, and seriously defensible, alternative centered on the destruction of hypotheses. He offers his version of geometry and astronomy as refuting the charge that he impiously ‘ponders things up in the sky and investigates things under the earth and makes the weaker argument the stronger’. We relate his account (...) briefly to mathematical developments by Plato's associates Theaetetus and Eudoxus, and then to the past 200 years' developments in geometry. (shrink)

Computational methods such as computer simulations, Monte Carlo methods, and agent-based modeling have become the dominant techniques in many areas of science. Extending Ourselves contains the first systematic philosophical account of these new methods, and how they require a different approach to scientific method. Paul Humphreys draws a parallel between the ways in which such computational methods have enhanced our abilities to mathematically model the world, and the more familiar ways in which scientific instruments have expanded our access to the (...) empirical world. This expansion forms the basis for a new kind of empiricism, better suited to the needs of science than the older anthropocentric forms of empiricism. Human abilities are no longer the ultimate standard of epistemological correctness.Humphreys also includes arguments for the primacy of properties rather than objects, the need to consider technological constraints when appraising scientific methods, and a detailed account of how the path from computational template to scientific application is constructed. This last feature allows us to hold a form of selective realism in which anti-realist arguments based on formal reconstructions of theories can be avoided. One important consequence of the rise of computational methods is that the traditional organization of the sciences is being replaced by an organization founded on computational templates.Extending Ourselves will be of interest to philosophers of science, epistemologists, and to anyone interested in the role played by computers in modern science. (shrink)

The technological sciences have at least six defining characteristics that distinguish them from the other sciences. They have human-made rather than natural objects as their study objects, include the practice of engineering design, define their study objects in functional terms, evaluate these study objects with category-specified value statements, employ less far-reaching idealizations than the natural sciences, and do not need an exact mathematical solution when a sufficiently close approximation is available. In combination, the six characteristics are sufficient to show that (...) the technological sciences are neither branches nor applications of the natural sciences, but form a different group of sciences with specific characteristics of their own.Keywords: Technological sciences; Technology; Functional concepts; Idealization; Design. (shrink)

Truth’s universal knowability entails its discovery. This threatens antirealism, which is thought to require it. Fortunately, antirealism is not committed to it. Avoiding it requires adoption (and extension) of Dag Prawitz’s position in his long-term disagreement with Michael Dummett on the notion of provability involved in intuitionism’s identification of it with truth. Antirealism (intuitionism generalized) must accommodate a notion of lost-opportunity truth (a kind of recognition-transcendent truth), and even truth consisting in the presence of unperformable verifications. Dummett’s position cannot abide (...) this, while Prawitz’s can. Antirealism’s epistemic notion of truth derives from general features of its meaning theory, not from a universal knowability principle. (shrink)

A recent attempt to compute a (recursion‐theoretic) noncomputable function using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion‐theoretic) notion of computability. A speculation is then offered as to where the putative power of quantum computers may come from.

I criticize a recent paper by Thomas Tymoczko in which he attributes fundamental philosophical significance and novelty to the lately-published computer-assisted proof of the four color theorem (4CT). Using reasoning precisely analogous to that employed by Tymoczko, I argue that much of traditional mathematical proof must be seen as resting on what Tymoczko must take as being "empirical" evidence. The new proof of the 4CT, with its use of what Tymoczko calls "empirical" evidence is therefore not so novel as he (...) maintains. Finally, without attempting to give a full account of the notion of empirical mathematical evidence, I sketch a view showing how the use of calculation injects an empirical ingredient into proof. (shrink)

A version of the Church-Turing Thesis states that every effectively realizable physical system can be simulated by Turing Machines (‘Thesis P’). In this formulation the Thesis appears to be an empirical hypothesis, subject to physical falsification. We review the main approaches to computation beyond Turing definability (‘hypercomputation’): supertask, non-well-founded, analog, quantum, and retrocausal computation. The conclusions are that these models reduce to supertasks, i.e. infinite computation, and that even supertasks are no solution for recursive incomputability. This yields that the realization (...) of hypercomputing devices is implausible, and that Thesis P is not essentially different from the standard Church-Turing Thesis. (shrink)

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...) of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

Gualtiero Piccinini articulates and defends a mechanistic account of concrete, or physical, computation. A physical system is a computing system just in case it is a mechanism one of whose functions is to manipulate vehicles based solely on differences between different portions of the vehicles according to a rule defined over the vehicles. Physical Computation discusses previous accounts of computation and argues that the mechanistic account is better. Many kinds of computation are explicated, such as digital vs. analog, serial vs. (...) parallel, neural network computation, program-controlled computation, and more. Piccinini argues that computation does not entail representation or information processing although information processing entails computation. Pancomputationalism, according to which every physical system is computational, is rejected. A modest version of the physical Church-Turing thesis, according to which any function that is physically computable is computable by Turing machines, is defended. (shrink)

_The Philosophy of Action: An Anthology_ is an authoritative collection of key work by top scholars, arranged thematically and accompanied by expert introductions written by the editors. This unique collection brings together a selection of the most influential essays from the 1960s to the present day. An invaluable collection that brings together a selection of the most important classic and contemporary articles in philosophy of action, from the 1960’s to the present day No other broad-ranging and detailed coverage of this (...) kind currently exists in the field Each themed section opens with a synoptic introduction and includes a comprehensive further reading list to guide students Includes sections on action and agency, willing and trying, intention and intentional action, acting for a reason, the explanation of action, and free agency and responsibility Written and organised in a style that allows it to be used as a primary teaching resource in its own right. (shrink)

This article studies the legacy in the West of Abū al-Wafā’s Book on those Geometric Constructions which are Necessary for Craftsmen. Although two-thirds of the geometric constructions in the text also appear in Renaissance works, a joint analysis of original solutions, diagram lettering and probability leads to a robust finding of independent discovery. The analysis shows that there is little chance that the similarities between the contents of Abū al-Wafā’s Book and the works of Tartaglia, Marolois and Schwenter owe anything (...) to historical transmission. The commentary written by Kamāl al-Dīn Ibn Yūnus seems to have had no Latin legacy either. (shrink)

This book offers a critical account of the fundamental elements of Leibniz's philosophy, as they manifest themselves in his metaphysics and philosophy of language. Emphasis is placed upon his hitherto neglected doctrine of nominalism, which states that only concrete individuals exist and that there are no such things as abstract entities – no numbers, geometrical figures or other mathematical objects, nor any abstractions such as space, time, heat, light, justice, goodness, or beauty. Using this doctrine as a basis, the book (...) considers the core of Leibniz's metaphysics and philosophy of language, including the well‐known principles of Contradiction, Sufficient Reason, Continuity and Individuation, and the concepts of Possible World, Individual Substance, Truth, and Necessity. (shrink)

The mapping of numbers onto space is fundamental to measurement and to mathematics. Is this mapping a cultural invention or a universal intuition shared by all humans regardless of culture and education? We probed number-space mappings in the Mundurucu, an Amazonian indigene group with a reduced numerical lexicon and little or no formal education. At all ages, the Mundurucu mapped symbolic and nonsymbolic numbers onto a logarithmic scale, whereas Western adults used linear mapping with small or symbolic numbers and logarithmic (...) mapping when numbers were presented nonsymbolically under conditions that discouraged counting. This indicates that the mapping of numbers onto space is a universal intuition and that this initial intuition of number is logarithmic. The concept of a linear number line appears to be a cultural invention that fails to develop in the absence of formal education. (shrink)

In diesem Aufsatz stelle ich mir die Aufgabe, den Einfluß von Leibniz' Idee einer lingua characterica und eines calculus ratiocinator auf Gottlob Freges Projekt einer Begriffsschrift im groben Aufriß auf Grund begrifflicher Parallelen darzulegen.

Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approximate numbers that are far beyond their naming range. However, they fail in exact arithmetic with numbers larger than 4 (...) or 5. Our results imply a distinction between a nonverbal system of number approximation and a language-based counting system for exact number and arithmetic. (shrink)

It is sometimes said that simulation can serve as epistemic substitute for experimentation. Such a claim might be suggested by the fast-spreading use of computer simulation to investigate phenomena not accessible to experimentation. But what does that mean? The paper starts with a clarification of the terms of the issue and then focuses on two powerful arguments for the view that simulation and experimentation are ‘epistemically on a par’. One is based on the claim that, in experimentation, no less than (...) in simulation, it is not the system under study that is manipulated but a system that ‘stands-in’ for it. The other one highlights the pervasive use of models in experimentation. It will be argued that these arguments, as compelling as they might seem, are each based on a mistaken interpretation of experimentation and that, far from simulation and experimentation being epistemically on a par, they do not have the same epistemic function, do not produce the same kind of epistemic results. (shrink)

A true Turing machine requires an infinitely long paper tape. Thus a TM can be housed in the infinite world of Newtonian spacetime, but not necessarily in our world, because our world-at least according to our best spacetime theory, general relativity-may be finite. All the same, one can argue for the "existence" of a TM on the basis that there is no such housing problem in some other relativistic worlds that are similar to our world. But curiously enough-and this is (...) the main point of this paper-some of these close worlds have a special spacetime structure that allows TMs to perform certain Turing unsolvable tasks. For example, in one kind of spacetime a TM can be used to solve first-order predicate logic and the halting problem. And in a more complicated spacetime, TMs can be used to decide arithmetic. These new computers serve to show that Church's thesis is a thoroughly contingent claim. Moreover, since these new computers share the fundamental properties of a TM in ordinary operation, a computability theory based on these non-Turing computers is no less worthy of investigation than orthodox computability theory. Some ideas about this new mathematical theory are given. (shrink)

A true Turing machine (TM) requires an infinitely long paper tape. Thus a TM can be housed in the infinite world of Newtonian spacetime (the spacetime of common sense), but not necessarily in our world, because our world-at least according to our best spacetime theory, general relativity-may be finite. All the same, one can argue for the "existence" of a TM on the basis that there is no such housing problem in some other relativistic worlds that are similar ("close") to (...) our world. But curiously enough-and this is the main point of this paper-some of these close worlds have a special spacetime structure that allows TMs to perform certain Turing unsolvable tasks. For example, in one kind of spacetime a TM can be used to solve first-order predicate logic and the halting problem. And in a more complicated spacetime, TMs can be used to decide arithmetic. These new computers serve to show that Church's thesis is a thoroughly contingent claim. Moreover, since these new computers share the fundamental properties of a TM in ordinary operation (e.g. intuitive, finitely programmed, limited in computational capability), a computability theory based on these non-Turing computers is no less worthy of investigation than orthodox computability theory. Some ideas about this new mathematical theory are given. (shrink)