Artefacts do not always do what they are supposed to, due to a variety of reasons, including manufacturing problems, poor maintenance, and normal wear-and-tear. Since software is an artefact, it should be subject to malfunctioning in the same sense in which other artefacts can malfunction. Yet, whether software is on a par with other artefacts when it comes to malfunctioning crucially depends on the abstraction used in the analysis. We distinguish between “negative” and “positive” notions of malfunction. A negative malfunction, (...) or dysfunction, occurs when an artefact token either does not or cannot do what it is supposed to. A positive malfunction, or misfunction, occurs when an artefact token may do what is supposed to but, at least occasionally, it also yields some unintended and undesirable effects. We argue that software, understood as type, may misfunction in some limited sense, but cannot dysfunction. Accordingly, one should distinguish software from other technical artefacts, in view of their design that makes dysfunction impossible for the former, while possible for the latter. (shrink)

The moving spotlight account (MS) is a view that combines an eternalist ontology and an A-theoretic metaphysics. The intuition underlying MS is that the present time is somehow privileged and experientially vivid, as if it were illuminated by a moving spotlight. According to MS-theorists, a key reason to prefer MS to B-theoretic eternalism is that our experience of time supports it. We argue that this is false. To this end, we formulate a new family of positions in the philosophy of (...) time, which differ from MS in that, intuitively, they admit a plurality of moving spotlights. We argue that these ‘deviant’ variants of MS cannot be dismissed as conceptually incoherent, and that they are as well-supported by our experience as is MS. One of these variants, however, is consistent with the B-theory. Thus, if our experience of time supports MS, then it supports the B-theory as well. (shrink)

Computing, today more than ever before, is a multi-faceted discipline which collates several methodologies, areas of interest, and approaches: mathematics, engineering, programming, and applications. Given its enormous impact on everyday life, it is essential that its debated origins are understood, and that its different foundations are explained. On the Foundations of Computing offers a comprehensive and critical overview of the birth and evolution of computing, and it presents some of the most important technical results and philosophical problems of the discipline, (...) combining both historical and systematic analyses. -/- The debates this text surveys are among the latest and most urgent ones: the crisis of foundations in mathematics and the birth of the decision problem, the nature of algorithms, the debates on computational artefacts and malfunctioning, and the analysis of computational experiments. By covering these topics, On the Foundations of Computing provides a much-needed resource to contextualize these foundational issues. -/- For practitioners, researchers, and students alike, a historical and philosophical approach such as what this volume offers becomes essential to understand the past of the discipline and to figure out the challenges of its future. (shrink)

Open futurism is the indeterministic position according to which the future is ‘open’, i.e., there is now no fact of the matter as to what future contingent events will actually obtain. Many open futurists hold a branching conception of time, in which a variety of possible futures exist. This paper introduces two challenges to branching-time open futurism, which are similar in spirit to a challenge posed by Fine to tense realism. The paper argues that, to address the new challenges, open (...) futurists must adopt an objective, non-perspectival notion of actuality and subscribe to an A-theoretic, dynamic conception of reality. Moreover, given a natural understanding of “actual future”, it is perfectly sensible for open futurists to hold that a unique, objectively actual future exists, contrary to a common assumption in the current debate. The paper also contends that recognising the existence of a unique actual future helps open futurists to avoid potential misconceptions. (shrink)

This paper explores taste fragmentalism, a novel approach to matters of taste and faultless disagreement. The view is inspired by Kit Fine’s fragmentalism about time, according to which the temporal dimension can be constituted—in an absolute manner—by states that are pairwise incompatible, provided that they do not obtain together. In the present paper, we will apply this metaphysical framework to taste states. In our proposal, two incompatible taste states (such as the state of rhubarb’s being tasty and the state of (...) rhubarb’s being distasteful) can both constitute reality in an absolute manner, although no agent can have joint access to both states. We will then develop a formalised version of our view by means of an exact truthmaker semantics for taste assertions. Within this framework—we argue—our linguistic and inferential practices concerning cases of faultless disagreement are elegantly vindicated, thus suggesting that taste fragmentalism is worth of further consideration. (shrink)

CHAPTER Structure and function In physical systems made by a large number of basic constituents one can observe collective properties which find their ...

We provide a full characterization of computational error states for information systems. The class of errors considered is general enough to include human rational processes, logical reasoning, scientific progress and data processing in some functional programming languages. The aim is to reach a full taxonomy of error states by analysing the recovery and processing of data. We conclude by presenting machine-readable checking and resolve algorithms.

The constructive reformulation of the semantic theory suggests two basic principles to be assumed: first, the distinction between proper knowledge, expressed in judgemental form, and the assertion conditions for such knowledge; second, ...

Any attempt to conceptualize, categorize and constraint foundational issues in a living science, such as Computing, is bound to show its limitations and leave a number of open issues. Taking stock with some critical reviews of Primiero (On the foundations of computing, Oxford University Press, Oxford, 2019) published in this Journal, I overview potential new problems to be investigated by a foundational analysis of the science of computing.

The process of completing, correcting and prioritising specifications is an essential but very complex task for the maintenance and improvement of software systems. The preservation of functionalities and the ability to accommodate changes are main objectives of the software development cycle to guarantee system reliability. Logical theories able to fully model such processes are still insufficient. In this paper we propose a full formalisation of such operations on software systems inspired by the Alchourrón–Gärdenfors–Makinson paradigm for belief revision of human epistemic (...) states. We represent specifications as finite sets of formulas equipped with a priority relation that models functional entrenchment of properties. We propose to handle specification incompleteness through ordered expansion, inconsistency through ordered safe contraction and prioritisation through revision with reordering, and model all three in an algorithmic fashion. We show how the system satisfies basic properties of the AGM paradigm, including Levi’s and Harper’s identities. We offer a concrete example and complexity results for the inference and model checking problems on revision. We conclude by describing resilience and evolvability of software systems based on such revision operators. (shrink)

Malware has been around since the 1980s and is a large and expensive security concern today, constantly growing over the past years. As our social, professional and financial lives become more digitalised, they present larger and more profitable targets for malware. The problem of classifying and preventing malware is therefore urgent, and it is complicated by the existence of several specific approaches. In this paper, we use an existing malware taxonomy to formulate a general, language independent functional description of malware (...) as transformers between states of the host system and described by a trust relation with its components. This description is then further generalised in terms of mechanisms, thereby contributing to a general understanding of malware. The aim is to use the latter in order to present an improved classification method for malware. (shrink)

Accidents involving autonomous vehicles raise difficult ethical dilemmas and legal issues. It has been argued that self-driving cars should be programmed to kill, that is, they should be equipped with pre-programmed approaches to the choice of what lives to sacrifice when losses are inevitable. Here we shall explore a different approach, namely, giving the user/passenger the task of deciding what ethical approach should be taken by AVs in unavoidable accident scenarios. We thus assume that AVs are equipped with what we (...) call an “Ethical Knob”, a device enabling passengers to ethically customise their AVs, namely, to choose between different settings corresponding to different moral approaches or principles. Accordingly, AVs would be entrusted with implementing users’ ethical choices, while manufacturers/programmers would be tasked with enabling the user’s choice and ensuring implementation by the AV. (shrink)

So-called Locke's thesis is the view that no two things of the same kind may coincide, that is, may be completely in the same place at the same time. A number of counter-examples to this view have been proposed. In this paper, some new and arguably more convincing counter-examples to Locke's thesis are presented. In these counter-examples, a particular entity (a string, a rope, a net, or similar) is interwoven to obtain what appears to be a distinct, thicker entity of (...) the same kind. It is argued that anyone who subscribes to certain standard metaphysical arguments, which are generally taken for granted in the debate about Locke's thesis, is virtually compelled to accept the counter-examples. (shrink)

The recent in vitro derivation of gamete‐like cells from mouse embryonic stem (mES) cells is a major breakthrough and lays down several challenges, both for the further scientific investigation and for the bioethical and biolegal discourse. We refer here to these cells as gamete‐like (sperm‐like or oocyte‐like, respectively), because at present there is still no evidence that these cells behave fully like bona fide sperm or oocytes, lacking the fundamental proof, i.e. combination with a normally derived gamete of the opposite (...) sex to yield a normal individual. However, the results published so far do show that these cells share some defining features of gametes. We discuss these results in the light of the bioethical and legal questions that are likely to arise would the same process become possible with human embryonic stem (hES) cells. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti's conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate (...) how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to B|A from A and B can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals. (shrink)

We offer a formal treatment of the semantics of both complete and incomplete mistrustful or distrustful information transmissions. The semantics of such relations is analysed in view of rules that define the behaviour of a receiving agent. We justify this approach in view of human agent communications and secure system design. We further specify some properties of such relations.

This book provides a general survey of the main concepts, questions and results that have been developed in the recent interactions between quantum information, quantum computation and logic. Divided into 10 chapters, the books starts with an introduction of the main concepts of the quantum-theoretic formalism used in quantum information. It then gives a synthetic presentation of the main “mathematical characters” of the quantum computational game: qubits, quregisters, mixtures of quregisters, quantum logical gates. Next, the book investigates the puzzling entanglement-phenomena (...) and logically analyses the Einstein–Podolsky–Rosen paradox and introduces the reader to quantum computational logics, and new forms of quantum logic. The middle chapters investigate the possibility of a quantum computational semantics for a language that can express sentences like “Alice knows that everybody knows that she is pretty”, explore the mathematical concept of quantum Turing machine, and illustrate some characteristic examples that arise in the framework of musical languages. The book concludes with an analysis of recent discussions, and contains a Mathematical Appendix which is a survey of the definitions of all main mathematical concepts used in the book. (shrink)

We present a review of Raymond Turner’s Book Computational Artifacts – Towards a Philosophy of Computer Science, focusing on three main topics: Design, Malfunction, and Validity.

We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability to be the conditional probability. In our approach, however, we avoid triviality because the import-export principle is invalid. We then analyze an example of reasoning under partial knowledge where, given a conditional if A then Cas information, the probability of A should intuitively increase. We explain (...) this intuition by making some implicit background information explicit. We consider several iterated conditionals, which allow us to formalize different kinds of latent information. We verify that for these iterated conditionals the prevision is greater than or equal to the probability of A. We also investigate the lower and upper bounds of the Affirmation of the Consequent inference. We conclude our study with some remarks on the supposed "independence" of two conditionals, and we interpret this property as uncorrelation between two random quantities. 2020 Elsevier Inc. All rights reserved. (shrink)

Coherent-ambiguity aversion is defined within the smooth-ambiguity model as the combination of choice-ambiguity and value-ambiguity aversion. Five ambiguous decision tasks are analyzed theoretically, where an individual faces two-stage lotteries with binomial, uniform, or unknown second-order probabilities. Theoretical predictions are then tested through a 10-task experiment. In tasks 1–5, risk aversion is elicited through both a portfolio choice method and a BDM mechanism. In tasks 6–10, choice-ambiguity aversion is elicited through the portfolio choice method, while value-ambiguity aversion comes about through the (...) BDM mechanism. The behavior of over 75 % of classified subjects is in line with the KMM model in all tasks 6–10, independent of their degree of risk aversion. Furthermore, the percentage of coherent-ambiguity-averse subjects is lower in the binomial than in the uniform and in the unknown treatments, with only the latter difference being significant. The most part of coherent-ambiguity-loving subjects show a high risk aversion. (shrink)

We analyze the results from three different risk attitude elicitation methods. First, the broadly used test by Holt and Laury, HL, second, the lottery-panel task by Sabater-Grande and Georgantzis, SG, and third, responses to a survey question on self-assessment of general attitude towards risk. The first and the second task are implemented with real monetary incentives, while the third concerns all domains in life in general. Like in previous studies, the correlation of decisions across tasks is low and usually statistically (...) non-significant. However, when we consider only subjects whose behavior across the panels of the SG task is compatible with constant relative risk aversion, the correlation between HL and self-assessed risk attitude becomes significant. Furthermore, the correlation between HL and SG also increases for CRRA-compatible subjects, although it remains statistically non-significant. (shrink)

In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle’s analysis of intentional action. We (...) then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: linguistic recursion is embodied in sensory-motor processing; linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains. (shrink)

Software-intensive science challenges in many ways our current scientific methods. This affects significantly our notion of science and scientific interpretation of the world, driving at the same time the philosophical debate. We consider some issues prompted by SIS in the light of the philosophical categories of ontology and epistemology.