Computer science only became established as a field in the 1950s, growing out of theoretical and practical research begun in the previous two decades. The field has exhibited immense creativity, ranging from innovative hardware such as the early mainframes to software breakthroughs such as programming languages and the Internet. Martin Gardner worried that "it would be a sad day if human beings, adjusting to the Computer Revolution, became so intellectually lazy that they lost their power of creative thinking" (...) (Gardner, 1978, p. vi-viii). On the contrary, computers and the theory of computation have provided great opportunities for creative work. This chapter examines several key aspects of creativity in computer science, beginning with the question of how problems arise in computer science. We then discuss the use of analogies in solving key problems in the history of computer science. Our discussion in these sections is based on historical examples, but the following sections discuss the nature of creativity using information from a contemporary source, a set of interviews with practicing computer scientists collected by the Association of Computing Machinery’s on-line student magazine, Crossroads. We then provide a general comparison of creativity in computer science and in the natural sciences. (shrink)

The subject of this study is the problem of the failure of attempts by the scientific community to come to a common understanding of what exactly information can be as something encoded into material structures and moved along with them. At the same time, the following aspects of this problem are considered in detail: what is the immediate cause of the information problem; what are the objective and subjective prerequisites for its appearance; why the unresolved nature of this problem does (...) not interfere with the creation and development of communication systems, control and other "smart" devices; is there any general guideline for finding solutions to such problems, and what is it; what role did the philosophy of information play in turning the problem of information from a private scientific problem into a problem of the ideological level. The main results of the conducted research are as follows: the immediate cause of the information problem has been identified and a comprehensively substantiated solution to this problem has been given; it has been revealed that the incompleteness of the materialistic theory of cognition has become a fertile ground for the appearance of this problem; the circumstances that prevented its completion have been identified; the natural mechanism of control and cognition has been revealed, as a result of which the materialistic theory of cognition has been further developed the source of the ideal in the material world is revealed; it is shown that the mechanistic idea of information coding made the concept of information incompatible with the presence of any objective content; it is revealed what is actually hidden behind the words about information coding and its measurement; the nature of signals and signs is revealed; a kind of bias of the philosophy of information and a general error is revealed all known concepts of information. (shrink)

Belonging uncertainty, defined as the general concern about the quality of one’s social relationships in an academic setting, has been found to be an important determinant of academic achievement and persistence. However, to date, only little research investigated the sources of belonging uncertainty. To address this research gap, we examined three potential sources of belonging uncertainty in a sample of undergraduate computer science students in Germany (N= 449) and focused on (a) perceived affective and academic exclusion by fellow (...) students, (b) domain-specific academic self-efficacy beliefs, and (c) perception of one’s individual performance potential compared to that of fellow students in the field. Perceived affective and academic exclusion by fellow students and domain-specific academic self-efficacy beliefs were significant predictors of female students’ uncertainty about belonging in computer science. The perception of one’s individual performance potential in comparison to that of fellow students, however, was a relevant predictor of both male and female students’ belonging uncertainty in computer science. Our findings imply an expanded view of the theoretical concept of belonging uncertainty that goes beyond mere concerns of social connectedness. (shrink)

The state of computing science and, particularly, software engineering and knowledge engineering is generally considered immature. The best starting point for achieving a mature engineering discipline is a solid scientific theory, and the primary reason behind the immaturity in these fields is precisely that computing science still has no such agreed upon underlying theory. As theories in other fields of science do, this paper formally establishes the fundamental elements and postulates making up a first attempt at a theory in this (...) field, considering the features and peculiarities of computing science. The fundamental elements of this approach are informons and holons, and it is a general and comprehensive theory of software engineering and knowledge engineering that related disciplines (e.g., information systems) can particularise and/or extend to take benefit from it (Lakatos’ concepts of core theory and protective belt theories). (shrink)

This volume contains the proceedings of three special sessions: Algebra and Computer Science, held during the Joint AMS-EMS-SPM meeting in Porto, Portugal, June 10–13, 2015; Groups, Algorithms, and Cryptography, held during the Joint Mathematics Meeting in San Antonio, TX, January 10–13, 2015; and Applications of Algebra to Cryptography, held during the Joint AMS-Israel Mathematical Union meeting in Tel-Aviv, Israel, June 16–19, 2014. Papers contained in this volume address a wide range of topics, from theoretical aspects of algebra, namely group (...) theory, universal algebra and related areas, to applications in several different areas of computer science. From the computational side, the book aims to reflect the rapidly emerging area of algorithmic problems in algebra, their computational complexity and applications, including information security, constraint satisfaction problems, and decision theory. The book gives special attention to recent advances in quantum computing that highlight the need for a variety of new intractability assumptions and have resulted in a new area called group-based cryptography. (shrink)

F. H. George is Professor of Cybernetics at Brunel University in England. His book comprises eight chapters originally developed as lectures for a non-specialist audience. He points out the position of computer science among the sciences, explains its aims, procedures, and achievements to date, and speculates on its long-term implications for science in particular and society in general. Among the topics discussed are biological simulation and organ replacement, automated education, and the new philosophy of science. Each chapter concludes (...) with a brief summary. George's treatment of the technical details of his speciality is both illuminating and readable, thus serving as an excellent primer on one of the new technology's most important components. His wider forays into philosophy, economics, sociology, and religion are less happy, however; and unfortunately they take up a large part of the text. In general, they reveal that George identifies the methods of human advancement with the methods of the natural sciences in an equation whose rigidity would make even B. F. Skinner blush. Yet, the reader cannot claim that he was not forewarned; for in the introduction, D. J. Stewart, Chairman of the Rationalist Press Association, suggests that the current "swing of interest among young people away from the physical and biological sciences and towards the behavioural and social sciences... represents a symptom of disillusionment with science and technology and an attempted escape into irrationality."--J. M. V. (shrink)

Abstract: Laws of computer science are prescriptive in nature but can have descriptive analogs in the physical sciences. Here, we describe a law of conservation of information in network programming, and various laws of computational motion (invariants) for programming in general, along with their pedagogical utility. Invariants specify constraints on objects in abstract computational worlds, so we describe language and data abstraction employed by software developers and compare them to Floridi's concept of levels of abstraction. We also consider (...) Floridi's structural account of reality and its fit for describing abstract computational worlds. Being abstract, such worlds are products of programmers' creative imaginations, so any "laws" in these worlds are easily broken. The worlds of computational objects need laws in the form of self-prescribed invariants, but the suspension of these laws might be creative acts. Bending the rules of abstract reality facilitates algorithm design, as we demonstrate through the example of search trees. (shrink)

Taking Brian Cantwell Smith’s study, “Limits of Correctness in Computers,” as its point of departure, this article explores the role of models in computer science. Smith identifies two kinds of models that play an important role, where specifications are models of problems and programs are models of possible solutions. Both presuppose the existence of conceptualizations as ways of conceiving the world “in certain delimited ways.” But high-level programming languages also function as models of virtual (or abstract) machines, while low-level (...) programming languages function as models of causal (or physical) machines. The resulting account suggests that sets of models embedded within models are indispensable for computer programming. (shrink)

This paper discusses how facet-like structures occur as a commonplace feature in a variety of computer science disciplines as a means for structuring class hierarchies. The paper then focuses on a mathematical model for facets (and class hierarchies in general), called formal concept analysis, and discusses graphical representations of faceted systems based on this model.

Part I presents a model of interactive computation and a metric for expressiveness, Part II relates interactive models of computation to physics, and Part III considers empirical models from a philosophical perspective. Interaction machines, which extend Turing Machines to interaction, are shown in Part I to be more expressive than Turing Machines by a direct proof, by adapting Gödel's incompleteness result, and by observability metrics. Observation equivalence provides a tool for measuring expressiveness according to which interactive systems are more expressive (...) than algorithms. Refinement of function equivalence by observation of outer interactive behavior and inner computation steps is examined. The change of focus from algorithms specified by computable functions to interaction specified by observation equivalence captures the essence of empirical computer science. Part II relates interaction in models of computation to observation in the natural sciences. Explanatory power in physics is specified by the same observability metric as expressiveness in interactive systems. Realist models of inner structure are characterized by induction, abduction, and Occam's Razor. Interactive realism extends the hidden-variable model of Einstein to hidden interfaces that provide extra degrees of freedom to formulate hypotheses with testable predictions conforming with quantum theory. Greater expressiveness of collaborative computational observers (writers) than single observers implies that hidden-interface models are more expressive than hidden-variable models. By providing a common foundation for empirical computational and physical models we can use precise results about computational models to establish properties of physical models. Part III shows that the evolution in computing from algorithms to interaction parallels that in physics from rationalism to empiricism. Plato's cave metaphor is interactively extended from Platonic rationalism to empiricism. The Turing test is extended to TMs with hidden interfaces that express interactive thinking richer than the traditional Turing test. Interactive (nonmonotonic) extensions of logic such as the closed-world assumption suggest that interactiveness is incompatible with monotonic logical inference. Procedure call, atomicity of transactions, and taking a fixed point are techniques for closing open systems similar to "preparation" followed by "observation" of a physical system. Pragmatics is introduced as a framework for extending logical models with a fixed syntax and semantics to multiple-interface models that support collaboration among clients sharing common resources. (shrink)

Excitement about digital agriculture—i.e., expanded reliance on collecting, integrating, analyzing, and applying digital data in agri-food systems—is bringing two different conceptualizations of abstraction into collision and dialogue. Critical agri-food scholars have long expressed concerns about disembedding—or abstracting—agriculture from particular geographies, farmers’ varied interests, and ecological processes. In contrast, in computer science, abstraction is understood as beneficial for taming the complexities of technology and supporting the development of general-purpose tools. In this paper, we compare these very different theorizations of (...) abstraction through an ethnographic case study of the early development of new digital agriculture networking infrastructure. We analyze how the commitments to abstraction in computer science relate to and depart from critical agri-food studies' critiques of decontextualization and disembedding. The study is based on a long-term collaboration between computer networking researchers and social scientists. Our findings indicate that the commitment to abstraction by computer network scientists leads them to engage minimally with critical agri-food studies’ concerns regarding historical processes of agricultural industrialization and their effect on farm size, the labor process, and the environment, but produces deep engagement with concerns regarding corporate control of innovation trajectories. We find, however, that the technologists focus on open innovation and vendor lock-in in order to expand the scale, scope, and pace of innovation, rather than to advance social justice and environmental sustainability, demonstrating that openness can be understood and practiced in various ways. Through integrated treatment of abstraction in computer science and critical agri-food studies, this article highlights opportunities and constraints for interdisciplinary analysis pertaining to the development of digital agriculture. Through ethnographic analysis of digital agriculture research and development, we identify mechanisms through which contemporary innovation processes are likely to reinforce the social, economic, and ecological relations of conventional agriculture. (shrink)

In this essay, I examine the notion of a nondeterministic algorithm from both a conceptual and historical point of view. I argue that the intuitions underwriting nondeterminism in the context of contemporary theoretical computer science cannot be reconciled with the intuitions that originally motivated nondeterminism. I identify four different intuitions about nondeterminism: nondeterminism as evidence for the Church Turing thesis; nondeterminism as a natural reflection of the mathematician's behavior; nondeterminism as a formal, mathematical generalization; and nondeterminism as a physical (...) process. I shall argue that there are irreconcilable tensions among these intuitions and, moreover, that these tensions have not been acknowledged in the conceptual development of theoretical computer science. In fact, a careful review of the received history reveals a number of gaps and discontinuities. For instance, I examine the seminal writings of Turing and argue that the formal introduction of the nondeterminism is to be found there and not, as is often supposed, in the research of the late 1950s and early 1960s. I also examine the period after 1960 and argue that even the more recent developments concerning nondeterminism are hard to reconstruct. ;Although I firmly believe that a rigorous philosophical account of nondeterminism is needed, I am not sure that such an account will bring us any closer to a solution to any of the notoriously difficult theoretical problems that turn on the notion of a nondeterministic algorithm. I do believe, however, that a clear conceptual account of nondeterminism will shed light on many long-standing philosophical problems. I conclude by pointing to a number of philosophical questions that resonate with issues raised by the foregoing investigation of nondeterministic algorithms. (shrink)

Various errors can affect scientific code and detecting them is a central concern within computational science. Could formal verification methods, which are now available tools, be widely adopted to guarantee the general reliability of scientific code? After discussing their benefits and drawbacks, we claim that, absent significant changes as regards features like their user-friendliness and versatility, these methods are unlikely to be adopted throughout computational science, beyond certain specific contexts for which they are well-suited. This issue exemplifies the epistemological (...) heterogeneity of computational science: profoundly different practices can be appropriate to meet the reliability challenge that rises for scientific code. (shrink)

This paper introduces the _Global Philosophy_ symposium on Giuseppe Primiero’s book _On the Foundations of Computing_ (2020). The collection gathers commentaries and responses of the author with the aim of engaging with some open questions in the philosophy of computer science. Firstly, this paper introduces the central themes addressed in Primiero’s book; secondly, it highlights some of the main critiques from commentators in order to, finally, pinpoint some conceptual challenges indicating future directions for the philosophy of computer science.

In this paper I attempt to cast the current program verification debate within a more general perspective on the methodologies and goals of computer science. I show, first, how any method involved in demonstrating the correctness of a physically executing computer program, whether by testing or formal verification, involves reasoning that is defeasible in nature. Then, through a delineation of the senses in which programs can be run as tests, I show that the activities of testing and (...) formal verification do not necessarily share the same goals and thus do not always constitute alternatives. The testing of a program is not always intended to demonstrate a program's correctness. Testing may seek to accept or reject nonprograms including algorithms, specifications, and hypotheses regarding phenomena. The relationship between these kinds of testing and formal verification is couched in a more fundamental relationship between two views of computer science, one properly containing the other. (shrink)

The effectiveness of evolutionary algorithms is one of the issues discussed in The Compatibility of Evolution and Design, where it is argued that such algorithms are only effective when stringent preconditions are met. This article considers this issue from the perspective of computer science. It explores the properties of problems that can be effectively solved by evolutionary algorithms, and the extent to which such algorithms need to be carefully adjusted. Although there are important differences between the study of evolutionary (...) algorithms in computer science and the study of biological evolution, it is argued that the experience of computer science can help to strengthen the claim that evolutionary mechanisms generally require a considerable degree of fine-tuning. (shrink)

This article presents the evolution of philosophical and methodological considerations concerning empiricism in computer/computing science. In this study, we trace the most important current events in the history of reflection on computing. The forerunners of Artificial Intelligence H.A. Simon and A. Newell in their paper Computer Science As Empirical Inquiry started these considerations. Later the concept of empirical computer science was developed by S.S. Shapiro, P. Wegner, A.H. Eden and P.J. Denning. They showed various empirical aspects of (...) computing. This led to a view of the science of computing - the science of general scope. Some interesting contemporary ways towards a generalized perspective on computations were also shown. (shrink)

Since the birth of computing as an academic discipline, the disciplinary identity of computing has been debated fiercely. The most heated question has concerned the scientific status of computing. Some consider computing to be a natural science and some consider it to be an experimental science. Others argue that computing is bad science, whereas some say that computing is not a science at all. This survey article presents viewpoints for and against computing as a science. Those viewpoints are analyzed against (...) basic positions in the philosophy of science. The article aims at giving the reader an overview, background, and a historical and theoretical frame of reference for understanding and interpreting some central questions in the debates about the disciplinary identity of computer science. The article argues that much of the discussion about the scientific nature of computing is misguided due to a deep conceptual uncertainty about science in general as well as computing in particular. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial (...) time. Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. (shrink)

This systematic investigation of computation and mental phenomena by a noted psychologist and computer scientist argues that cognition is a form of computation, that the semantic contents of mental states are encoded in the same general way as computer representations are encoded. It is a rich and sustained investigation of the assumptions underlying the directions cognitive science research is taking. 1 The Explanatory Vocabulary of Cognition 2 The Explanatory Role of Representations 3 The Relevance of Computation 4 (...) The Psychological Reality of Programs: Strong Equivalence 5 Constraining Functional Architecture 6 The Bridge from Physical to Symbolic: Transduction 7 Functional Architecture and Analogue Processes 8 Mental Imagery and Functional Architecture 9 Epilogue: What is Cognitive Science the Science of? (shrink)

A major approach to the ethics of artificial intelligence is to use social choice, in which the AI is designed to act according to the aggregate views of society. This is found in the AI ethics of “coherent extrapolated volition” and “bottom–up ethics”. This paper shows that the normative basis of AI social choice ethics is weak due to the fact that there is no one single aggregate ethical view of society. Instead, the design of social choice AI faces three (...) sets of decisions: standing, concerning whose ethics views are included; measurement, concerning how their views are identified; and aggregation, concerning how individual views are combined to a single view that will guide AI behavior. These decisions must be made up front in the initial AI design—designers cannot “let the AI figure it out”. Each set of decisions poses difficult ethical dilemmas with major consequences for AI behavior, with some decision options yielding pathological or even catastrophic results. Furthermore, non-social choice ethics face similar issues, such as whether to count future generations or the AI itself. These issues can be more important than the question of whether or not to use social choice ethics. Attention should focus on these issues, not on social choice. (shrink)

The article offers a discursive account of what generality in machine learning research means and how it is constructed in the development of general artificial intelligence from the perspectives of cultural and media studies. I discuss several technical papers that outline novel architectures in machine learning and how they conceive of the “world”. The agency to learn and the learning curriculum are modulated through worlding (in the sense of setting up and unfolding of the world for artificial agents) in (...) machine learning engineering. In recent computer science articles, large models trained on Internet-scale datasets are framed as general world simulators—despite their partiality, historicity, finite nature, and cultural specificity. I introduce the notion of “model worlds” to refer to composable interactive environments designed for the purpose of machine learning that partake in legitimising that claim. I discuss how large models are grounded through interaction in model worlds, arguing that model worlds mediate between the sheer scale of language models and their hypothetical capacity to generalise to new tasks and domains, rehashing the empiricist logic of “big data”. Further, I show that the emerging capacity of artificial agents to generalise redraws the epistemic boundary between artificial agents and their learning environments. Consequently, superficial statistics of language models and abstract action are made meaningful in distilled model worlds, giving rise to synthetic agency. (shrink)

It is generally accepted that, in the cognitive and neural sciences, there are both computational and mechanistic explanations. We ask how computational explanations can integrate into the mechanistic hierarchy. The problem stems from the fact that implementation and mechanistic relations have different forms. The implementation relation, from the states of an abstract computational system to the physical, implementing states is a homomorphism mapping relation. The mechanistic relation, however, is that of part/whole; the explaining features in a mechanistic explanation are the (...) components of the explanandum phenomenon and their causal organization. Moreover, each component in one level of mechanism is constituted and explained by components of an underlying level of mechanism. Hence, it seems, computational variables and functions cannot be mechanistically explained by the medium-dependent states and properties that implement them. How then, do the computational and the implementational integrate to create the mechanistic hierarchy? After explicating the general problem, we further demonstrate it through a concrete example, of reinforcement learning, in the cognitive and neural sciences. We then examine two possible solutions. On one solution, the mechanistic hierarchy embeds at the same levels computational and implementational properties. This picture fits with the view that computational explanations are mechanistic sketches. On the other solution, there are two separate hierarchies, one computational and another implementational, which are related by the implementation relation. This picture fits with the view that computational explanations are functional and autonomous explanations. It is less clear how these solutions fit with the view that computational explanations are full-fledged mechanistic explanations. Finally, we argue that both pictures are consistent with the reinforcement learning example, but that scientific practice does not align with the view that computational models are merely mechanistic sketches. (shrink)

Correspondence analysis is Kooi and Tamminga’s universal approach which generates in one go sound and complete natural deduction systems with independent inference rules for tabular extensions of many-valued functionally incomplete logics. Originally, this method was applied to Asenjo–Priest’s paraconsistent logic of paradox LP. As a result, one has natural deduction systems for all the logics obtainable from the basic three-valued connectives of LP -language) by the addition of unary and binary connectives. Tamminga has also applied this technique to the paracomplete (...) analogue of LP, strong Kleene logic \. In this paper, we generalize these results for the negative fragments of LP and \, respectively. Thus, the method of correspondence analysis works for the logics which have the same negations as LP or \, but either have different conjunctions or disjunctions or even don’t have them as well at all. Besides, we show that correspondence analyses for the negative fragments of \ and LP, respectively, are also suitable without any changes for the negative fragments of Heyting’s logic \ and its dual \ and LP). (shrink)

This book addresses key conceptual issues relating to the modern scientific and engineering use of computer simulations. It analyses a broad set of questions, from the nature of computer simulations to their epistemological power, including the many scientific, social and ethics implications of using computer simulations. The book is written in an easily accessible narrative, one that weaves together philosophical questions and scientific technicalities. It will thus appeal equally to all academic scientists, engineers, and researchers in industry (...) interested in questions related to the general practice of computer simulations. (shrink)

A growing body of research can be found in which roboticists are designing for reciprocity as a key construct for successful human–robot interaction (HRI). Given the centrality of reciprocity as a component for our moral lives (for moral development and maintaining the just society), this paper confronts the possibility of what things would look like if the benchmark to achieve perceived reciprocity were accomplished. Through an analysis of the value of reciprocity from the care ethics tradition the richness of reciprocity (...) as an inherent value is revealed: on the micro-level, as mutual care for immediate care givers, and on the macro-level, as foundational for a just society. Taking this understanding of reciprocity into consideration, it becomes clear that HRI cannot achieve this bidirectional value of reciprocity; a robot must deceive users into believing it is capable of reciprocating to humans or is deserving of reciprocation from humans. Moreover, on the macro-level, designing social robots for reciprocity threatens the ability and willingness to reciprocate to human care workers across society. Because of these concerns, I suggest re-thinking the goals of reciprocity in social robotics. Designing for reciprocity in social robotics should be dedicated to the design of robots to enhance the ability to mutually care for those that provide us with care, as opposed to designing for reciprocity between human and robot. (shrink)

This paper considers what liberal philosopher Michael Sandel coins the ‘moral limits of markets’ in relation to the idea of paying people for data about their biometrics and emotions. With Sandel arguing that certain aspects of human life (such as our bodies and body parts) should be beyond monetisation and exchange, others argue that emerging technologies such as Personal Information Management Systems can enable a fairer, paid, data exchange between the individual and the organisation, even regarding highly personal data about (...) our bodies and emotions. With the field of data ethics rarely addressing questions of payment, this paper explores normative questions about data dividends. It does so by conducting a UK-wide, demographically representative online survey to quantitatively assess adults’ views on being paid for personal data about their biometrics and emotions via a Personal Information Management System, producing a data dividend, a premise which sees personal data through the prism of markets and property. The paper finds diverse attitudes based on socio-demographic characteristics, the type of personal data sold, and the type of organisation sold to. It argues that (a) Sandel’s argument regarding the moral limits of markets has value in protecting fundamental freedoms of those in society who are arguably least able to (such as the poor); but (b) that contexts of use, in particular, blur moral limits regarding fundamental freedoms and markets. (shrink)

Humans use their spatial information processing abilities flexibly to facilitate problem solving and decision making in a variety of tasks. This article explores the question of whether a general strategy can be adapted for performing two different spatial orientation tasks by testing the predictions of a computational cognitive model. Human performance was measured on an orientation task requiring participants to identify the location of a target either on a map (find‐on‐map) or within an egocentric view of a space (find‐in‐scene). (...) A general strategy instantiated in a computational cognitive model of the find‐on‐map task, based on the results from, was adapted to perform both tasks and used to generate performance predictions for a new study. The qualitative fit of the model to the human data supports the view that participants were able to tailor a general strategy to the requirements of particular spatial tasks. The quantitative differences between the predictions of the model and the performance of human participants in the new experiment expose individual differences in sample populations. The model provides a means of accounting for those differences and a framework for understanding how human spatial abilities are applied to naturalistic spatial tasks that involve reasoning with maps. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...) distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

This paper presents an intuitive explanation about why and how Rawlsian Theory of Justice (Rawls in A theory of justice, Harvard University Press, Harvard, 1971) provides the foundations to a solution for algorithmic bias. The contribution of the paper is to discuss and show why Rawlsian ideas in their original form (e.g. the veil of ignorance, original position, and allowing inequalities that serve the worst-off) are relevant to operationalize fairness for algorithmic decision making. The paper also explains how this leads (...) to a specific MinMaxfairness solution, which addresses the basic challenges of algorithmic justice. We combine substantive elements of Rawlsian perspective with an intuitive explanation in order to provide accessible and practical insights. The goal is to propose and motivate why and how the MinMaxfairness solution derived from Rawlsian principles overcomes some of the current challenges for algorithmic bias and highlight the benefits provided when compared to other approaches. The paper presents and discusses the solution by building a bridge between the qualitative theoretical aspects and the quantitative technical approach. (shrink)

Like previous educational technologies, artificial intelligence in education threatens to disrupt the status quo, with proponents highlighting the potential for efficiency and democratization, and skeptics warning of industrialization and alienation. However, unlike frequently discussed applications of AI in autonomous vehicles, military and cybersecurity concerns, and healthcare, AI’s impacts on education policy and practice have not yet captured the public’s attention. This paper, therefore, evaluates the status of AIEd, with special attention to intelligent tutoring systems and anthropomorphized artificial educational agents. I (...) discuss AIEd’s purported capacities, including the abilities to simulate teachers, provide robust student differentiation, and even foster socio-emotional engagement. Next, to situate developmental pathways for AIEd going forward, I contrast sociotechnical possibilities and risks through two idealized futures. Finally, I consider a recent proposal to use peer review as a gatekeeping strategy to prevent harmful research. This proposal serves as a jumping off point for recommendations to AIEd stakeholders towards improving their engagement with socially responsible research and implementation of AI in educational systems. (shrink)

In light of the growing need to pay attention to general public opinions and sentiments toward AI, this paper examines the levels of understandings amongst the Australian public toward the increased societal use of AI technologies. Drawing on a nationally representative survey of 2019 adults across Australia, the paper examines how aware people consider themselves to be of recent developments in AI; variations in popular conceptions of what AI is; and the extent to which levels of support for AI (...) are liable to alter with additional exposure to information about AI. While a majority of respondents consider themselves to have little knowledge and familiarity with the topic of AI, the survey nevertheless finds considerable range of relatively ‘plausible’ basic understandings of what AI is. Significantly, repeated questioning highlights a willingness among many people to reassess their opinions once having received further information about AI, and being asked to think through issues relating to AI and society. These patterns remain relatively consistent, regardless of respondents’ political orientation, income, social class and other demographic characteristics. As such, the paper concludes by considering how these findings provide support for the development of public education efforts to further enhance what might be termed ‘public understanding of AI’. (shrink)

This paper focuses on the use of ‘black box’ AI in medicine and asks whether the physician needs to disclose to patients that even the best AI comes with the risks of cyberattacks, systematic bias, and a particular type of mismatch between AI’s implicit assumptions and an individual patient’s background situation.Pacecurrent clinical practice, I argue that, under certain circumstances, these risks do need to be disclosed. Otherwise, the physician either vitiates a patient’s informed consent or violates a more general (...) obligation to warn him about potentially harmful consequences. To support this view, I argue, first, that the already widely accepted conditions in the evaluation of risks, i.e. the ‘nature’ and ‘likelihood’ of risks, speak in favour of disclosure and, second, that principled objections against the disclosure of these risks do not withstand scrutiny. Moreover, I also explain that these risks are exacerbated by pandemics like the COVID-19 crisis, which further emphasises their significance. (shrink)

The societal and ethical implications of artificial intelligence (AI) have sparked discussions among academics, policymakers and the public around the world. What has gone unnoticed so far are the likewise vibrant discussions in China. We analyzed a large sample of discussions about AI ethics on two Chinese social media platforms. Findings suggest that participants were diverse, and included scholars, IT industry actors, journalists, and members of the general public. They addressed a broad range of concerns associated with the application (...) of AI in various fields. Some even gave recommendations on how to tackle these issues. We argue that these discussions are a valuable source for understanding the future trajectory of AI development in China as well as implications for global dialogue on AI governance. (shrink)

Experiments (E), computer simulations (CS) and thought experiments (TE) are usually seen as playing different roles in science and as having different epistemologies. Accordingly, they are usually analyzed separately. We argue in this paper that these activities can contribute to answering the same questions by playing the same epistemic role when they are used to unfold the content of a well-described scenario. We emphasize that in such cases, these three activities can be described by means of the same conceptual (...) framework—even if each of them, because they involve different types of processes, fall under these concepts in different ways. We further illustrate our claims by presenting a threefold case study describing how a TE, a CS and an E were indeed used in the same role at different periods to answer the same questions about the possibility of a physical Maxwellian demon. We also point at fluid dynamics as another field where these activities seem to be playing the same unfolding role. We analyze the importance of unfolding as a general task of science and highlight how our description in terms of epistemic functions articulates in a noncommittal way with the epistemology of these three activities and accounts for their similarities and the existence of hybrid forms of activities. We finally emphasize that picturing these activities as functionally substitutable does not imply that they are epistemologically substitutable. (shrink)

Stein once urged us not to confuse the means of representation with that which is being represented. Yet that is precisely what philosophers of science appear to have done at the meta-level when it comes to representing the practice of science. Proponents of the so-called ‘syntactic’ view identify theories as logically closed sets of sentences or propositions and models as idealised interpretations, or ‘theoruncula, as Braithwaite called them. Adherents of the ‘semantic’ approach, on the other hand, are typically characterised as (...) taking them to be families of models that are set-theoretic, according to Suppes and others, or abstract, as Giere has argued. da Costa and French (Science and Partial Truth. OUP, Oxford, 2003) suggested that we should refrain from ontological speculation as to the nature of scientific theories and models and focus on their appropriate representation for various purposes within the philosophy of science. Such an approach allows both linguistic and non-linguistic resources to play their appropriate role (see also French and Saatsi, Philosophy of Science, Proceedings of the 2004 PSA Meeting, 78:548–559, 2006) and can be supported by recent case studies illustrating the heterogeneity of scientific practice. My aim in this paper is to further develop this ‘quietist’ view, and to indicate how it offers a fruitful way forward for the philosophy of science. (shrink)

Imagine if, when broken-hearted by their romantic partner leaving them, a person could continue the relationship with a chatbot or avatar version of them. This might seem like a far-fetched scenario but a little thought reveals that, first, this is a product that could plausibly make its way to the market and, second, it would be harmful for both parties of the former relationship and plausibly abusive for the person who has been ‘bot-ed’ without their consent.

Released mid-November 2022, Galactica is a set of six large language models (LLMs) of different sizes (from 125 M to 120B parameters) designed by Meta AI to achieve the ultimate ambition of “a single neural network for powering scientific tasks”, according to its accompanying whitepaper. It aims to carry out knowledge-intensive tasks, such as publication summarization, information ordering and protein annotation. However, just a few days after the release, Meta had to pull back the demo due to the strong hallucinatory (...) tendencies or underwhelming performances of the model. This article aims to study, through a critical threefold argument, the potential impacts of LLMs once deployed in the scientific value chain. Our first argument is a technical one. By examining the technicity of Galactica, it is possible to explain the descripancies between its promotional corporate discourse and abysmal outputs. Second, by going back to debates in both computer science and computational philosophy on the automation of abduction, we argue from the epistemological front that LLMs indeed cannot produce strong abductions and, therefore, claims about the automation of hypothesis generation remains chambering. Finally, our third argument is a sociological one. By conceptualizing the scientific field through Nancy Katherine Hayles’ cognitive assemblage theory, we aim to outline the potential steering of science by LLMs, mainly through information ordering. The core of our argument rests on the assertion that excessive control on information risks contravening a certain serendipitous aspect inherent to scientific discoveries. (shrink)

Following the studies of Araujo et al. (AI Soc 35:611–623, 2020) and Lee (Big Data Soc 5:1–16, 2018), this empirical study uses two scenario-based online experiments. The sample consists of 221 subjects from Germany, differing in both age and gender. The original studies are not replicated one-to-one. New scenarios are constructed as realistically as possible and focused on everyday work situations. They are based on the AI acceptance model of Scheuer (Grundlagen intelligenter KI-Assistenten und deren vertrauensvolle Nutzung. Springer, Wiesbaden, 2020) (...) and are extended by individual descriptive elements of AI systems in comparison to the original studies. The first online experiment examines decisions made by artificial intelligence with varying degrees of impact. In the high-impact scenario, applicants are automatically selected for a job and immediately received an employment contract. In the low-impact scenario, three applicants are automatically invited for another interview. In addition, the relationship between age and risk perception is investigated. The second online experiment tests subjects’ perceived trust in decisions made by artificial intelligence, either semi-automatically through the assistance of human experts or fully automatically in comparison. Two task types are distinguished. The task type that requires “human skills”—represented as a performance evaluation situation—and the task type that requires “mechanical skills”—represented as a work distribution situation. In addition, the extent of negative emotions in automated decisions is investigated. The results are related to the findings of Araujo et al. (AI Soc 35:611–623, 2020) and Lee (Big Data Soc 5:1–16, 2018). Implications for further research activities and practical relevance are discussed. (shrink)

As public administrations adopt artificial intelligence (AI), we see this transition has the potential to transform public service and public policies, by offering a rapid turnaround on decision making and service delivery. However, a recent series of criticisms have pointed to problematic aspects of mainstreaming AI systems in public administration, noting troubled outcomes in terms of justice and values. The argument supplied here is that any public administration adopting AI systems must consider and address ambiguities and uncertainties surrounding two key (...) dimensions: the algorithms’ results, and how public managers make decisions for and about AI systems’ design. The article is based on bibliographic research in institutional theory perspective that relates the design of AI systems and relevant literature on the decision-making process in public policy. The main finding is to explain why autonomous decision systems continue to reproduce ambiguities and uncertainties when applied in public administration and propose a reflection on AI governance in public administration. This article points to the need for design institutions that immerse themselves in understanding the nuances, details, and potential outcomes of AI governance for public administration. Such institutions would reconcile consequentialist logic with a logic of appropriateness to help navigate and mediate ambiguities and uncertainties. (shrink)

Artificial intelligence is poised to eliminate millions of jobs, from finance to truck driving. But artisanal products are valued precisely because of their human origins, and thus have some inherent “immunity” from AI job loss. At the same time, artisanal labor, combined with technology, could potentially help to democratize the economy, allowing independent, small-scale businesses to flourish. Could AI, robotics and related automation technologies enhance the economic viability and environmental sustainability of these beloved crafting professions, perhaps even expanding their niche (...) to replace some job loss in other sectors? In this paper, we compare the problems created by the current mass production economy and potential solutions from an artisanal economy. In doing so, the paper details the possibilities of utilizing AI to support hybrid forms of human–machine production at the microscale; localized and sustainable value chains at the mesoscale; and networks of these localized and sustainable producers at the macroscale. In short, a wide range of automation technologies are potentially available for facilitating and empowering an artisanal economy. Ultimately, it is our hope that this paper will facilitate a discussion on a future vision for more “generative” economic forms in which labor value, ecological value and social value can circulate without extraction or alienation. (shrink)

Certain research strands can yield “forbidden knowledge”. This term refers to knowledge that is considered too sensitive, dangerous or taboo to be produced or shared. Discourses about such publication restrictions are already entrenched in scientific fields like IT security, synthetic biology or nuclear physics research. This paper makes the case for transferring this discourse to machine learning research. Some machine learning applications can very easily be misused and unfold harmful consequences, for instance, with regard to generative video or text synthesis, (...) personality analysis, behavior manipulation, software vulnerability detection and the like. Up till now, the machine learning research community embraces the idea of open access. However, this is opposed to precautionary efforts to prevent the malicious use of machine learning applications. Information about or from such applications may, if improperly disclosed, cause harm to people, organizations or whole societies. Hence, the goal of this work is to outline deliberations on how to deal with questions concerning the dissemination of such information. It proposes a tentative ethical framework for the machine learning community on how to deal with forbidden knowledge and dual-use applications. (shrink)