Evolutionary applications of game theory present one of the most pedagogically accessible varieties of genuine, contemporary theoretical biology. We present here Oyun (OY-oon, http://charlespence.net/oyun), a program designed to run iterated prisoner’s dilemma tournaments, competitions between prisoner’s dilemma strategies developed by the students themselves. Using this software, students are able to readily design and tweak their own strategies, and to see how they fare both in round-robin tournaments and in “evolutionary” tournaments, where the scores in a given “generation” (...) directly determine contribution to the population in the next generation. Oyun is freely available, runs on Windows, Mac, and Linux computers, and the process of creating new prisoner’s dilemma strategies is both easy to teach and easy for students to grasp. We illustrate with two interesting examples taken from actual use of Oyun in the classroom. (shrink)

This article presents the results of an empirical study of the “sportification” of amateur-level competitive computer gaming. How do amateur players, who are unlikely to become professional esports players, turn what is considered to be enjoyable entertainment into a collective activity that demonstrates traits traditionally associated with professional sports, such as self-discipline, a focus on achieving results and overcoming personal limitations? Ethnographic research, consisting of in-depth interviews and participant observations, was conducted in the last quarter of 2019 based on (...) a series of tournaments (Rocket League, Counter-Strike: Global Offensive, League of Legends, and Rainbow Six Siege) managed by a student esports club of a Moscow-based university. Such clubs combine different levels of esports practice: players who consider themselves amateurs who attend tournaments “for fun”, players seeking professionalization and who have already received the first modest revenue from their activity, as well as players who achieved the status of a cyberathlete through membership in one of the university teams. Thus, student esports represents an ideal environment for exploring the dynamics of changes in the meanings that players put into their activity, as well as for finding elements holding to­gether what could be called “esports culture”. The analysis conducted in the present article is based not so much on the interpretations of the phe­nomenon of esports that exists in the field of game studies, as on two clas­sical sociological traditions: the writings of Erving Goffman and Howard Becker, on the one hand, and those of Max Weber and Norbert Elias on the other. As a result, the process of the “sportification” of the amateur practice of competitive computer games is presented in the article as a change in the actors’ level of reflexivity: towards the game, towards themselves during play, and towards the world around the game, occurring as they move through the stages of the “career of a competitive player”. ­. (shrink)

In contrast to Axelrod’s advice “don’t be envious” it is argued that the emotion of envy may enhance cooperation. TIT FOR TAT does exhibit a certain degree of envy. But, it does so in inconsistent ways. Two variants of TIT FOR TAT are introduced and their strategic properties are analyzed. Both generate the very same actual play as TIT FOR TAT in a computer tournament without noise. However, if noise is introduced they display some greater degree of stability. This (...) is due to the fact that they form, in a prisoner’s dilemma supergame with suitable parameters, an equilibrium with themselves that is subgame perfect or (in case of the first strategy) close to subgame perfect. It is additionally argued that these strategies are exceptionally clear and comprehensible to others in that they conform to well known real live behavior patterns. (shrink)

This chapter contains section titled: Kin Selection Reciprocity Group Selection Coercion Mutualism Byproduct Mutualism Local Interactions References.

The Erdős–Moser ([Formula: see text]) theorem says that every infinite tournament admits an infinite transitive subtournament. We study the computational behavior of the [Formula: see text] theorem with respect to the arithmetic hierarchy, and prove that [Formula: see text] instances of [Formula: see text] admit low[Formula: see text] solutions for every [Formula: see text], and that if a set [Formula: see text] is not arithmetical, then every instance of [Formula: see text] admits a solution relative to which [Formula: see text] (...) is still not arithmetical. We also provide a level-wise refinement of this theorem. These results are part of a larger program of computational study of combinatorial theorems in Reverse Mathematics. (shrink)

In a series of formal studies and less formal applications, Hong and Page offer a ‘diversity trumps ability’ result on the basis of a computational experiment accompanied by a mathematical theorem as explanatory background (Hong & Page 2004, 2009; Page 2007, 2011). “[W]e find that a random collection of agents drawn from a large set of limited-ability agents typically outperforms a collection of the very best agents from that same set” (2004, p. 16386). The result has been extremely influential as (...) an epistemic justification for diversity policy initiatives. Here we show that the ‘diversity trumps ability’ result is tied to the particular random landscape used in Hong and Page’s simulation. We argue against interpreting results on that random landscape in terms of ‘ability’ or ‘expertise.’ These concepts are better modeled on smother and more realistic landscapes, but keeping other parameters the same those are landscapes on which it is groups of the best performing that do better. Smoother landscapes seem to vindicate both the concept and the value of expertise. Change in other parameters, however, also vindicates diversity. With an increase in the pool of available heuristics, diverse groups again do better. Group dynamics makes a difference as well; simultaneous ‘tournament’ deliberation in a group in place of the ‘relay’ deliberation in Hong and Page’s original model further emphasizes an advantage for diversity. ‘Tournament’ 2 dynamics particularly shows the advantage of mixed groups that include both experts and non-experts. As a whole, our modeling results suggest that relative to problem characteristics and conceptual resources, the wisdom of crowds and the wisdom of the few each have a place. We regard ours as a step toward attempting to calibrate their relative virtues in different modelled contexts of intellectual exploration. (shrink)

We consider exponentially large finite relational structures (with the universe {0.1}ⁿ) whose basic relations are computed by polynomial size (nO(1)) circuits. We study behaviour of such structures when pulled back by P/poly maps to a bigger or to a smaller universe. In particular, we prove that: 1. If there exists a P/poly map g: {0.1} → {0.1}m, n < m, iterable for a proof system then a tautology (independent of g) expressing that a particular size n set is dominating in (...) a size 2ⁿ tournament is hard for the proof system. 2. The search problem WPHP, decoding RSA or finding a collision in a hashing function can be reduced to finding a size m homogeneous subgraph in a size 22m graph. Further we reduce the proof complexity of a concrete tautology (expressing a Ramsey property of a graph) in strong systems to the complexity of implicit proofs of implicit formulas in weak proof systems. (shrink)

We describe a broad class of problems, called “uncompromising problems,” which are characterized by the requirement that solutions must perform optimally on each of many test cases. Many of the problems that have long motivated genetic programming research, including the automation of many traditional programming tasks, are uncompromising. We describe and analyze the recently proposed “lexicase” parent selection algorithm and show that it can facilitate the solution of uncompromising problems by genetic programming. Unlike most traditional parent selection techniques, lexicase selection (...) does not base selection on a fitness value that is aggregated over all test cases; rather, it considers test cases one at a time in random order. We present results comparing lexicase selection to more traditional parent selection methods, including standard tournament selection and implicit fitness sharing, on four uncompromising problems: 1) finding terms in finite algebras; 2) designing digital multipliers; 3) counting words in files; and 4) performing symbolic regression of the factorial function. We provide evidence that lexicase selection maintains higher levels of population diversity than other selection methods, which may partially explain its utility as a parent selection algorithm in the context of uncompromising problems. (shrink)

One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[n] : n ∈ ω) approximating α and (b[n] : n ∈ ω) approximating β and a positive constant C such that for all n, C(α − a[n]) ≥ (β − b[n]). See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin’s Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. (...) Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. We show that every recursively enumerable random real dominates all other recursively enumerable reals. We conclude that the recursively enumerable random reals are exactly the Ω-numbers [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. Second, we show that the sets in a universal Martin-Lof test for randomness have random measure, and every recursively enumerable random number is the sum of the measures represented in a universal Martin-Lof test. (shrink)

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus (...) presents the state of the art in the area. (shrink)

This unique volume introduces and discusses the methods of validating computer simulations in scientific research. The core concepts, strategies, and techniques of validation are explained by an international team of pre-eminent authorities, drawing on expertise from various fields ranging from engineering and the physical sciences to the social sciences and history. The work also offers new and original philosophical perspectives on the validation of simulations. Topics and features: introduces the fundamental concepts and principles related to the validation of (...) class='Hi'>computer simulations, and examines philosophical frameworks for thinking about validation; provides an overview of the various strategies and techniques available for validating simulations, as well as the preparatory steps that have to be taken prior to validation; describes commonly used reference points and mathematical frameworks applicable to simulation validation; reviews the legal prescriptions, and the administrative and procedural activities related to simulation validation; presents examples of best practice that demonstrate how methods of validation are applied in various disciplines and with different types of simulation models; covers important practical challenges faced by simulation scientists when applying validation methods and techniques; offers a selection of general philosophical reflections that explore the significance of validation from a broader perspective. This truly interdisciplinary handbook will appeal to a broad audience, from professional scientists spanning all natural and social sciences, to young scholars new to research with computer simulations. Philosophers of science, and methodologists seeking to increase their understanding of simulation validation, will also find much to benefit from in the text. (shrink)

This essay provides a critique of mainstream computer ethics and argues for the importance of a complementary approach called disclosive computer ethics, which is concerned with the moral deciphering of embedded values and norms in computer systems, applications and practices. Also, four key values are proposed as starting points for disclosive studies in computer ethics: justice, autonomy, democracy and privacy. Finally, it is argued that research in disclosive computer ethics should be multi-level and interdisciplinary, distinguishing (...) between a disclosure level, a theoretical level, and an an application level. (shrink)

This article provides a survey of some of the reasons why computational approaches have become a permanent addition to the set of scientific methods. The reasons for this require us to represent the relation between theories and their applications in a different way than do the traditional logical accounts extant in the philosophical literature. A working definition of computer simulations is provided and some properties of simulations are explored by considering an example from quantum chemistry.

In this paper, we pursue three general aims: (I) We will define a notion of fundamental opacity and ask whether it can be found in High Energy Physics (HEP), given the involvement of machine learning (ML) and computer simulations (CS) therein. (II) We identify two kinds of non-fundamental, contingent opacity associated with CS and ML in HEP respectively, and ask whether, and if so how, they may be overcome. (III) We address the question of whether any kind of opacity, (...) contingent or fundamental, is unique to ML or CS, or whether they stand in continuity to kinds of opacity associated with other scientific research. (shrink)

Should all digital communication be accessible to government inspection? Is robust cryptography in the hands of the public a threat to our national security? With Dorothy Denning and Patrick Sullivan.

We examine the philosophical disputes among computer scientists concerning methodological, ontological, and epistemological questions: Is computer science a branch of mathematics, an engineering discipline, or a natural science? Should knowledge about the behaviour of programs proceed deductively or empirically? Are computer programs on a par with mathematical objects, with mere data, or with mental processes? We conclude that distinct positions taken in regard to these questions emanate from distinct sets of received beliefs or paradigms within the discipline: (...) – The rationalist paradigm, which was common among theoretical computer scientists, defines computer science as a branch of mathematics, treats programs on a par with mathematical objects, and seeks certain, a priori knowledge about their ‘correctness’ by means of deductive reasoning. – The technocratic paradigm, promulgated mainly by software engineers and has come to dominate much of the discipline, defines computer science as an engineering discipline, treats programs as mere data, and seeks probable, a posteriori knowledge about their reliability empirically using testing suites. – The scientific paradigm, prevalent in the branches of artificial intelligence, defines computer science as a natural (empirical) science, takes programs to be entities on a par with mental processes, and seeks a priori and a posteriori knowledge about them by combining formal deduction and scientific experimentation. We demonstrate evidence corroborating the tenets of the scientific paradigm, in particular the claim that program-processes are on a par with mental processes. We conclude with a discussion in the influence that the technocratic paradigm has been having over computer science. (shrink)

Reasons are given to justify the claim that computer simulations and computational science constitute a distinctively new set of scientific methods and that these methods introduce new issues in the philosophy of science. These issues are both epistemological and methodological in kind.

There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.

Despite the emergence of computer games as a dominant cultural industry, we know little or nothing about the ethics of computer games. Considerations of the morality of computer games seldom go beyond intermittent portrayals of them in the mass media as training devices for teenage serial killers. In this first scholarly exploration of the subject, Miguel Sicart addresses broader issues about the ethics of games, the ethics of playing the games, and the ethical responsibilities of game designers. (...) He argues that computer games are ethical objects, that computer game players are ethical agents, and that the ethics of computer games should be seen as a complex network of responsibilities and moral duties. Players should not be considered passive amoral creatures; they reflect, relate, and create with ethical minds. The games they play are ethical systems, with rules that create gameworlds with values at play. Drawing on concepts from philosophy and game studies, Sicart proposes a framework for analyzing the ethics of computer games as both designed objects and player experiences. After presenting his core theoretical arguments and offering a general theory for understanding computer game ethics, Sicart offers case studies examining single-player games, multiplayer games, and online gameworlds from an ethical perspective. He explores issues raised by unethical content in computer games and its possible effect on players and offers a synthesis of design theory and ethics that could be used as both analytical tool and inspiration in the creation of ethical gameplay. (shrink)

Artificial intelligence (AI) is increasingly being developed for use in medicine, including for diagnosis and in treatment decision making. The use of AI in medical treatment raises many ethical issues that are yet to be explored in depth by bioethicists. In this paper, I focus specifically on the relationship between the ethical ideal of shared decision making and AI systems that generate treatment recommendations, using the example of IBM’s Watson for Oncology. I argue that use of this type of system (...) creates both important risks and significant opportunities for promoting shared decision making. If value judgements are fixed and covert in AI systems, then we risk a shift back to more paternalistic medical care. However, if designed and used in an ethically informed way, AI could offer a potentially powerful way of supporting shared decision making. It could be used to incorporate explicit value reflection, promoting patient autonomy. In the context of medical treatment, we need value-flexible AI that can both respond to the values and treatment goals of individual patients and support clinicians to engage in shared decision making. (shrink)

An excessive preoccupation with formalism is impeding the development of computer science. Form- content confusion is discussed relative to three areas: theory of computation, programming languages, and education.

Technological advancements often lead to revolutions in the creation of art; but, what is unclear is whether such advancements always correspond to revolutions regarding the artistic medium. The notion of an artistic medium is central to our thinking about, engagement with, and appreciation of art. Accounts of the interpretation, understanding, and experience of art must at some point grapple with the role of the artistic medium against such endeavors. Moreover, artists do not choose their medium by accident, but presumably do (...) so with an eye to the specific and unique affordances of their chosen medium. This chapter will explore the ways in which technology affects these issues. One question we could ask is, when does some technology itself become a new artistic medium? Some technological advancements result in the creation of a new artistic medium—like photography—while others do not—like procedural music. Finding “technology” itself to be too broad of a concept to define a distinctive and theoretically useful notion of an artistic medium, this chapter will examine generally what sort of barriers or challenges one might face when thinking of different technologies as themselves constituting an artistic medium. Specific attention will be paid to the notion of the medium and the theoretical and aesthetic work that such a notion plays in regard to works of computer art. (shrink)

What is computer art? Do the concepts we usually employ to talk about art, such as ‘meaning’, ‘form’ or ‘expression’ apply to computer art? _A Philosophy of Computer Art_ is the first book to explore these questions. Dominic Lopes argues that computer art challenges some of the basic tenets of traditional ways of thinking about and making art and that to understand computer art we need to place particular emphasis on terms such as ‘interactivity’ and (...) ‘user’. Drawing on a wealth of examples he also explains how the roles of the computer artist and computer art user distinguishes them from makers and spectators of traditional art forms and argues that computer art allows us to understand better the role of technology as an art medium. (shrink)

Considers the question of the authorship of the works in the title from a /philosophical/, as opposed to legal, standpoint, using the sense-reference dichotomy, intension-extension dichotomy, and procedural knowledge-declarative knowledge dichotomy. Reaches no conclusion.

IntroductionInformation and communication technologies are becoming an integral part of medical practice, research and administration and their use will grow as telemedicine and electronic medical record use become part of routine practice. Security in maintaining patient data is important and there is a statuary obligation to do so, but few health professionals have been trained on how to achieve this. There is no information on the use of computers and email by doctors and nurses in South Africa in the workplace (...) and at home, and whether their current computer practices meets legal and ethical requirements. The aims of this study were to determine the use of computers by healthcare practitioners in the workplace and home; the use and approach to data storage, encryption and security of patient data and patient email; and the use of informed consent to transmit data by email.MethodsA self-administered questionnaire was administered to 400 health care providers from the state and private health care sectors. The questionnaire covered computer use in the workplace and at home, sharing of computers, data encryption and storage, email use, encryption of emails and storage, and the use of informed consent for email communication.Results193 doctors and 207 nurses in the private and public sectors completed the questionnaire. Forty (10%) of participants do not use a computer. A third of health professionals were the only users of computers at work or at home. One hundred and ninety-eight respondents (55%) did not know if the data on the computers were encrypted, 132 (36.7%) knew that the data were not encrypted and 30 (8.3%) individuals knew that the data on the computers they were using were encrypted. Few doctors, 58 (16%), received emails from patients, with doctors more likely to receive emails from patients than nurses (p = 0.0025). Thirty-one percent of individuals did not respond to the emails. Emails were saved by 40 (69%) recipients but only 5 (12.5%) doctors encrypted the messages, 19 (47.5%) individuals knowingly did not encrypt and 16 (40.0%) did not know if they encrypted the data. While 20% of health professionals have emailed patient data, but only 41.7% gained consent to do so.ConclusionsMost health professionals as sampled in South Africa are not compliant with the National Health Act or the Electronic Communications Transactions Act of South Africa or guidelines from regulatory bodies when managing patient data on computers. Many appear ignorant or lack the ability to comply with simple data security procedures. (shrink)

This article aims to evaluate the purported empirical character of computer-assisted proof, as suggested by Thomas Tymoczko and others. Tymoczko famously argued that the proof of the Four-Color Theorem introduced a new, empirical method of proof, forcing us to modify the traditional conception of mathematical argument as a priori reasoning. Detlefsen and Luker contended that Tymoczko’s suggestion entailed that typically mathematical proofs were empirical. My chief interest is to raise some objections to a line of thought common to both (...) of these arguments, with a view to outlining an account of the a priori which allows thepossibility of a priori knowledge obtained by appeal to computers or through testimony. Drawing on some recent discussions by Tyler Burge, this account gives a broad construal of the non-justificatory, ‘enabling’ role that experience is held to play in knowledge and cognition, allowing us to argue that the purported empirical character of the appeal to computers pertains only to the role experience plays in enabling our access to the a priori warrant provided by computer proof. (shrink)

In recent years, with the development of construction industry, more scientific, systematic, fast, and intelligent calculation methods are needed to coordinate urban development and fierce market competition, and mathematical algorithm library plays an important role in artificial intelligence. Therefore, the author uses computer mathematical algorithm and extension theory to study and analyze the residential building design and intelligent data mining. It is found that the research of the computer-aided expression method of extension building planning is mainly the expression (...) of the input and output system of extension building planning. It includes knowledge representation, system outline design, system flow, and interface expression based on the mathematical database. (shrink)

The article discusses the use of algorithmic models in finance (algo or high frequency trading). Algo trading is widespread but also somewhat controversial in modern financial markets. It is a form of automated trading technology, which critics claim can, among other things, lead to market manipulation. Drawing on three cases, this article shows that manipulation also can happen in the reverse way, meaning that human traders attempt to make algorithms ‘make mistakes’ by ‘misleading’ them. These attempts to manipulate are very (...) simple and immediately transparent to humans. Nevertheless, financial regulators increasingly penalize such attempts to manipulate algos. The article explains this as an institutionalization of algo trading, a trading practice which is vulnerable enough to need regulatory protection. (shrink)

Interactive theorem provers might seem particularly impractical in the history of philosophy. Journal articles in this discipline are generally not formalized. Interactive theorem provers involve a learning curve for which the payoffs might seem minimal. In this article I argue that interactive theorem provers have already demonstrated their potential as a useful tool for historians of philosophy; I do this by highlighting examples of work where this has already been done. Further, I argue that interactive theorem provers can continue to (...) be useful tools for historians of philosophy in the future; this claim is defended through a more conceptual analysis of what historians of philosophy do that identifies argument reconstruction as a core activity of such practitioners. It is then shown that interactive theorem provers can assist in this core practice by a description of what interactive theorem provers are and can do. If this is right, then computer verification for historians of philosophy is in the offing. (shrink)

Robertson's earlier work, The New Renaissance projected the likely future impact of computers in changing our culture. Phase Change builds on and deepens his assessment of the role of the computer as a tool driving profound change by examining the role of computers in changing the face of the sciences and mathematics. He shows that paradigm shifts in understanding in science have generally been triggered by the availability of new tools, allowing the investigator a new way of seeing into (...) questions that had not earlier been amenable to scientific probing. (shrink)

Recently, information retrieval is shown to be a science by mapping information retrieval scientific study to scientific study abstracted from physics. The exercise was rather tedious and lengthy. Instead of dealing with the nitty gritty, this paper looks at the insights into how computer science can be made into a science by using that methodology. That is by mapping computer science scientific study to the scientific study abstracted from physics. To show the mapping between computer science and (...) physics, we need to define what is engineering science which computer science belongs to. Some principles and assumptions of engineering science theory are presented. To show computer science is a science, we presented two approaches. Approach 1 considers computer science as simulation of human behaviour similar to the goal of artificial intelligence. Approach 2 is closely related to the actual activities in computer science, and this approach considers computer science based on the theory of computation. Finally, we answer some of the common outstanding issues about computer science to convince our reader that computer science is a science. (shrink)

Intelligent algorithms together with various machine learning techniques hold a dominant position among major challenges for contemporary value sensitive design. Self-learning capabilities of current AI applications blur the causal link between programmer and computer behavior. This creates a vital challenge for the design, development and implementation of digital technologies nowadays. This paper seeks to provide an account of this challenge. The main question that shapes the current analysis is the following: What conceptual tools can be developed within the value (...) sensitive design school of thought for evaluating machine learning algorithms where the causal relation between designers and the behavior of their computer systems has been eroded? The answer to this question will be provided through two levels of investigation within the value sensitive design methodology. The first level is conceptual. Within the conceptual level, we will introduce the notion of computer intentionality and will show how this term may be used for solving an issue of non-causal relation between designer and computer system. The second level of investigation is technical. At this level the emphasis will be given to machine learning algorithms. (shrink)

This paper is in two parts. Part I outlines three traditional approaches to the teaching of critical thinking: the normative, cognitive psychology, and educational approaches. Each of these approaches is discussed in relation to the influences of various methods of critical thinking instruction. The paper contrasts these approaches with what I call the “visualisation” approach. This approach is explained with reference to computer-aided argument mapping (CAAM) which uses dedicated computer software to represent inferences between premise and conclusions. The (...) paper presents a detailed account of the CAAM methodology, and theoretical justification for its use, illustrating this with the argument mapping software Rationale™. A number of Rationale™ design conventions and logical principles are outlined including the principle of abstraction, the MECE principle, and the “Holding Hands” and “Rabbit Rule” heuristics. Part II of this paper outlines the growing empirical evidence for the effectiveness of CAAM as a method of teaching critical thinking. (shrink)