Computability logic (CL) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, "truth" means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations for ever more expressive fragments of CL, the present paper introduces a new deductive system CL12 and proves its soundness and completeness with (...) respect to the semantics of CL. Conservatively extending classical predicate calculus and offering considerable additional expressive and deductive power, CL12 presents a reasonable, computationally meaningful, constructive alternative to classical logic as a basis for applied theories. To obtain a model example of such theories, this paper rebuilds the traditional, classical-logic-based Peano arithmetic into a computability-logic-based counterpart. Among the purposes of the present contribution is to provide a starting point for what, as the author wishes to hope, might become a new line of research with a potential of interesting findings—an exploration of the presumably quite unusual metatheory of CL-based arithmetic and other CL-based applied systems. (shrink)

The present essay includes an overview of key milestones in the development of computer ethics as a field of applied ethics. It also describes the ongoing debate about the proper scope of CE, as a subfield both in applied ethics and computer science. Following a brief description of the cluster of ethical issues that CE scholars and practitioners have generally considered to be the standard or "mainstream" issues comprising the field thus far, the essay speculates about the future (...) direction of CE and describes some theoretical and practical questions that will likely arise. (shrink)

This book deals with a major problem in the study of language: the problem of reference. The ease with which we refer to things in conversation is deceptive. Upon closer scrutiny, it turns out that we hardly ever tell each other explicitly what object we mean, although we expect our interlocutor to discern it. Amichai Kronfeld provides an answer to two questions associated with this: how do we successfully refer, and how can a computer be programmed to achieve this? Beginning (...) with the major theories of reference, Dr Kronfeld provides a consistent philosophical view which is a synthesis of Frege's and Russell's semantic insights with Grice's and Searle's pragmatic theories. This leads to a set of guiding principles, which are then applied to a computational model of referring. The discussion is made accessible to readers from a number of backgrounds: in particular, students and researchers in the areas of computational linguistics, artificial intelligence and the philosophy of language will want to read this book. (shrink)

The spacing effect is among the most widely replicated empirical phenomena in the learning sciences, and its relevance to education and training is readily apparent. Yet successful applications of spacing effect research to education and training is rare. Computational modeling can provide the crucial link between a century of accumulated experimental data on the spacing effect and the emerging interest in using that research to enable adaptive instruction. In this paper, we review relevant literature and identify 10 criteria for rigorously (...) evaluating computational models of the spacing effect. Five relate to evaluating the theoretic adequacy of a model, and five relate to evaluating its application potential. We use these criteria to evaluate a novel computational model of the spacing effect called the Predictive Performance Equation. Predictive Performance Equation combines elements of earlier models of learning and memory including the General Performance Equation, Adaptive Control of Thought—Rational, and the New Theory of Disuse, giving rise to a novel computational account of the spacing effect that performs favorably across the complete sets of theoretic and applied criteria. We implemented two other previously published computational models of the spacing effect and compare them to PPE using the theoretic and applied criteria as guides. (shrink)

This paper proposes two formal models for understanding real-life dialogues, aimed at capturing argumentative structures performatively enacted during conversations. In the course of the investigation, two types of discourse with a high degree of well-structured argumentation were chosen: moral debate and financial communication. The research project found itself confronted by a need to analyse, structure and formally describe large volumes of textual data, where this called for the application of computational tools. It is expected that the results of the proposed (...) research will make a contribution to formal systems modelling and the evaluation of communication from the point of view of argument soundness. (shrink)

In the course of consumer behavior, it is necessary to study the relationship between the characteristics of psychological activities and the laws of behavior when consumers acquire and use products or services. With the development of the Internet and mobile terminals, electronic commerce has become an important form of consumption for people. In order to conduct experiential education in E-commerce combined with consumer behavior, courses to understand consumer satisfaction. From the perspective of E-commerce companies, this study proposes to use artificial (...) intelligence image recognition technology to recognize and analyze consumer facial expressions. First, it analyzes the way of human–computer interaction in the context of E-commerce and obtains consumer satisfaction with the product through HCI technology. Then, a deep neural network is used to predict the psychological behavior and consumer psychology of consumers to realize personalized product recommendations. In the course education of consumer behavior, it helps to understand consumer satisfaction and make a reasonable design. The experimental results show that consumers are highly satisfied with the products recommended by the system, and the degree of sanctification reaches 93.2%. It is found that the DNN model can learn consumer behavior rules during evaluation, and its prediction effect is increased by 10% compared with the traditional model, which confirms the effectiveness of the recommendation system under the DNN model. This study provides a reference for consumer psychological behavior analysis based on HCI in the context of AI, which is of great significance to help understand consumer satisfaction in consumer behavior education in the context of E-commerce. (shrink)

The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether defined in different manners, via function algebras (Real Recursive Functions) or via Turing Machines (Computable Analysis). We provide general tools for investigating these issues, using two techniques we call approximation and lifting. We use these methods to obtain two main theorems. First, we provide an alternative proof of the result from Campagnolo et al. (...) (J Complex 18:977–1000, 2002), which precisely relates the Kalmar elementary computable functions to a function algebra over the reals. Second, we build on that result to extend a result of Bournez and Hainry (Theor Comput Sci 348(2–3):130–147, 2005), which provided a function algebra for the ${\mathcal{C}}^2$ real elementary computable functions; our result does not require the restriction to ${\mathcal{C}}^2$ functions. In addition to the extension, we provide an alternative approach to the proof. Their proof involves simulating the operation of a Turing Machine using a function algebra. We avoid this simulation, using a technique we call lifting, which allows us to lift the classic result regarding the elementary computable functions to a result on the reals. The two new techniques bring a different perspective to these problems, and furthermore appear more easily applicable to other problems of this sort. (shrink)

A number of different uniquenessclaims have been made about computer ethics inorder to justify characterizing it as adistinct subdiscipline of applied ethics. Iconsider several different interpretations ofthese claims and argue, first, that none areplausible and, second, that none provideadequate justification for characterizingcomputer ethics as a distinct subdiscipline ofapplied ethics. Even so, I argue that computerethics shares certain important characteristicswith medical ethics that justifies treatingboth as separate subdisciplines of appliedethics.

By applying research in artificial intelligence to problems in the philosophy of science, Paul Thagard develops an exciting new approach to the study of scientific reasoning. This approach uses computational ideas to shed light on how scientific theories are discovered, evaluated, and used in explanations. Thagard describes a detailed computational model of problem solving and discovery that provides a conceptually rich yet rigorous alternative to accounts of scientific knowledge based on formal logic, and he uses it to illuminate such topics (...) as the nature of concepts, hypothesis formation, analogy, and theory justification. (shrink)

Intelligent neurotechnology is an emerging field that combines neurotechnologies like brain-computer interface (BCI) with artificial intelligence. This paper introduces a capability framework to assess the responsible use of intelligent BCI systems and provide practical ethical guidance. It proposes two tests, the threshold and flourishing tests, that BCI applications must meet, and illustrates them in a series of cases. After a brief introduction (Section 1), Section 2 sets forth the capability view and the two tests. It illustrates the threshold test using (...) examples from clinical medicine of BCI applications that enable patients with profound disabilities to function at a threshold level through computer mediation. Section 3 illustrates the flourishing test by exploring possible future applications of BCI involving neuroenhancements for healthy people, using examples adapted from research currently underway in the US military. Section 3 applies a capability lens to a complex case involving dual effects, both therapeutic and non-therapeutic, showing how the threshold and flourishing tests resolve the case. Section 4 replies to three objections: neurorights are the best tool for assessing BCI; the two tests are moving targets; and the analysis utilizes a capability view to do work it is not designed for. The paper concludes that a capability view offers unique advantages and gives practical guidance for evaluating the responsible use of present and future BCI applications. Extrapolating from our analysis may help guide other emerging technologies, such as germline gene editing, expected to impact central human capabilities. (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)

Since the sixties, computational modeling has become increasingly important in both the physical and the social sciences, particularly in physics, theoretical biology, sociology, and economics. Sine the eighties, philosophers too have begun to apply computational modeling to questions in logic, epistemology, philosophy of science, philosophy of mind, philosophy of language, philosophy of biology, ethics, and social and political philosophy. This chapter analyzes a selection of interesting examples in some of those areas.

Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.

At its beginnings Humanities Computing was characterized by a primary interest in methodological issues and their epistemological background. Subsequently, Humanities Computing practice has been prevailingly driven by technological developments and the main concern has shifted from content processing to the representation in digital form of documentary sources. The Digital Humanities turn has brought more to the fore artistic and literary practice in direct digital form, as opposed to a supposedly commonplace application of computational methods to scholarly research. As an example (...) of a way back to the original motivations of applied computation in the humanities, a formal model of the interpretive process is here proposed, whose implementation may be contrived through the application of data processing procedures typical of the so called artificial adaptive systems. (shrink)

PurposeThe purpose of this paper is to study the ethical behaviour of Muslim IT professionals in an attempt to stop many unethical practices such as software piracy, software intellectual property violations and general software development.Design/methodology/approachThis study examines the computer ethical principles presented in the Association for Computing Machinery code of conduct from an Islamic point of view through studying some relevant verses of The Holy Quran and Hadiths of Prophet Mohammed. An evaluation of the benefits of this newly proposed Islamic (...) computer code of ethics is presented by surveying how IT students, IT professionals and software house owners would adhere to it. The evaluation was carried out by teaching different groups of participants aspects of the ACM code of conduct and the proposed Islamic computer ethics code and then surveying their opinions by a questionnaire.FindingsThe study demonstrates that teaching computer ethics in general, and computer ethics from an Islamic point of view in particular, clearly contributes to ethical behaviour of Muslim IT professionals with regards to software development issues.Research limitations/implicationsIt is not possible to put participants through real life scenarios and practically observe how they would react to different ethical situations. The empirical research thus relies on what participants said they would do.Practical implicationsThe newly developed Islamic code of computer ethics and its proposed implementation method can be utilised by organisations for their benefit.Originality/valueThe study is the first to address the issue of computer ethics and Islam for IT professionals. This paper presents a first Islamic computer code of ethics and presents a methodology for applying it. It also reports a study undertaken in Bahrain of how attitudes might be influenced by teaching computer ethics in general, and computer ethics from an Islamic point of view in particular. (shrink)

There has been much debate whether computers can be responsible. This question is usually discussed in terms of personhood and personal characteristics, which a computer may or may not possess. If a computer fulfils the conditions required for agency or personhood, then it can be responsible; otherwise not. This paper suggests a different approach. An analysis of the concept of responsibility shows that it is a social construct of ascription which is only viable in certain social contexts and which serves (...) particular social aims. If this is the main aspect of responsibility then the question whether computers can be responsible no longer hinges on the difficult problem of agency but on the possibly simpler question whether responsibility ascriptions to computers can fulfil social goals. The suggested solution to the question whether computers can be subjects of responsibility is the introduction of a new concept, called “quasi-responsibility” which will emphasise the social aim of responsibility ascription and which can be applied to computers. (shrink)

Only computational explanations of a content‐involving sort can answer certain ‘how’‐questions; can support content‐involving counterfactuals; and have the generality characteristic of psychological explanations. Purely formal characteriza‐tions of computations have none of these properties, and do not determine content. These points apply not only to psychological explanation, but to Turing machines themselves. Computational explanations which involve content are not opposed to naturalism. They are also required if we are to explain the content‐involving properties of mental states.

This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, (...) the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties). (shrink)

This chapter contains sections titled: Technology, Ethics, and the Instrumentation of Human Action The Genus‐Species Account Avoiding the Mistake of Unique Technology Avoiding the Mistake of the Applied Ethics Model Conclusion Acknowledgment.

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 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)

The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature—one based on the issue of whether or not the physically measurable numbers predicted by the theory are computable in the mathematical sense. Applying this formulation to one approach to a quantum theory of gravity, there are found indications that there may exist no such (...) algorithms in this case. Finally, we discuss the issue of whether the existence of an algorithm to implement a theory should be adopted as a criterion for acceptable physical theories.“Can it then be that there is... something of use for unraveling the universe to be learned from the philosophy of computer design?” —J. A. Wheeler(1). (shrink)

Computation and information processing are among the most fundamental notions in cognitive science. They are also among the most imprecisely discussed. Many cognitive scientists take it for granted that cognition involves computation, information processing, or both – although others disagree vehemently. Yet different cognitive scientists use ‘computation’ and ‘information processing’ to mean different things, sometimes without realizing that they do. In addition, computation and information processing are surrounded by several myths; first and foremost, that they are (...) the same thing. In this paper, we address this unsatisfactory state of affairs by presenting a general and theory-neutral account of computation and information processing. We also apply our framework by analyzing the relations between computation and information processing on one hand and classicism and connectionism on the other. We defend the relevance to cognitive science of both computation, in a generic sense that we fully articulate for the first time, and information processing, in three important senses of the term. Our account advances some foundational debates in cognitive science by untangling some of their conceptual knots in a theory-neutral way. By leveling the playing field, we pave the way for the future resolution of the debates’ empirical aspects. (shrink)

Computational models of infant word‐finding typically operate over transcriptions of infant‐directed speech corpora. It is now possible to test models of word segmentation on speech materials, rather than transcriptions of speech. We propose that such modeling efforts be conducted over the speech of the experimental stimuli used in studies measuring infants' capacity for learning from spoken sentences. Correspondence with infant outcomes in such experiments is an appropriate benchmark for models of infants. We demonstrate such an analysis by applying the DP‐Parser (...) model of Algayres and colleagues to auditory stimuli used in infant psycholinguistic experiments by Pelucchi and colleagues. The DP‐Parser model takes speech as input, and creates multiple overlapping embeddings from each utterance. Prospective words are identified as clusters of similar embedded segments. This allows segmentation of each utterance into possible words, using a dynamic programming method that maximizes the frequency of constituent segments. We show that DP‐Parse mimics American English learners' performance in extracting words from Italian sentences, favoring the segmentation of words with high syllabic transitional probability. This kind of computational analysis over actual stimuli from infant experiments may be helpful in tuning future models to match human performance. (shrink)

This chapter will deal with an issue that is as much a problem for moral philosophy as it is for the computer world. My basic theme is that high technology, and computer technology in particular, raises ethical problems of a new sort that require considerable restructuring of our traditional ethical categories. It follows that our job as philosophers is not, as it is often thought to be, simply to apply ready-made categories to new situations; rather, it is to find new (...) categories, or new ways of interpreting old categories, in order to accommodate the challenges presented by new technologies. (shrink)

~Et moi,.... si j'avait su comment en revenir, One service mathematics has rendered the je n'y serais point alle.' human race. It has put common sense back Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non· The series is divergent; therefore we may be sense'. Eric T. Bell able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and (...) non­ linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics...'; 'One service logic has rendered com­ puter science...'; 'One service category theory has rendered mathematics...'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series. (shrink)

The prelims comprise: Introduction Metatheoretical and Methodological Issues Applied and Synthetic Ethics Traditional and Emerging Issues Conclusion Websites and Other Resources.

In computer ethics, as in other branches of applied ethics, the problem of the justification of moral judgment is still unresolved. I argue that the method which is referred to as “The Method of Wide Reflective Equilibrium” (WRE) offers the best solution to it. It does not fall victim to the false dilemma of having to choose either case‐based particularist or principle‐based universalist approaches to the problem of moral justification. I claim that WRE also provides the best model of (...) practical moral reasoning available for computer ethics. It does not pretend to provide quasi‐algorithmic procedures for moral decision‐making, but neither does it abandon the regulative ideal of communicative transparency in discursive public justification. (shrink)

In a world that is overflowing with journals and other outlets for scientific publication, the appearance of any new periodical requires some justification. There are already more journals than we can read and more conferences than we can attend. In the case of applied Ontology, we believe that the creation of anew journal not only is completely justifiable, it is downright exciting. For too long, workers in computer science have assumed that content comes for free. “Theory” in computer science (...) has always meant the theory of processes and of computation. We measure the complexity of computer programs in terms of how long it takes machines to execute them, not in terms of how long it takes people to understand and to represent the data on which those programs might operate. We typically describe computer code in terms of algorithms that operate on formal parameters, often without pausing to discuss where the data that might satisfy those parameters come from. This journal was founded on the premise that workers in computer science, informatics, and information science are overdue in paying as much attention to contents as they do to algorithms. (shrink)

This study is concerned with processes for discovering new theories in science. It considers a computational approach to scientific discovery, as applied to the discovery of theories in cognitive science. The approach combines two ideas. First, a process-based scientific theory can be represented as a computer program. Second, an evolutionary computational method, genetic programming, allows computer programs to be improved through a process of computational trialand-error. Putting these two ideas together leads to a system that can automatically generate and (...) improve scientific theories. The application of this method to the discovery of theories in cognitive science is examined. Theories are built up from primitive operators. These are contained in a theory language that defines the space of possible theories. An example of a theory generated by this method is described. These results support the idea that scientific discovery can be achieved through a heuristic search process, even for theories involving a sequence of steps. However, this computational approach to scientific discovery does not eliminate the need for human input. Human judgment is needed to make reasonable prior assumptions about the characteristics of operators used in the theory generation process, and to interpret and provide context for the computationally generated theories. (shrink)

A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.

The question about the scientific nature of computing has been widely debated with no universal consensus reached about its disciplinary status. Positions vary from acknowledging computing as the science of computers to defining it as a synthetic engineering discipline. In this paper, we aim at discussing the nature of computing from a methodological perspective. We consider, in particular, the nature and role of experiments in this field, whether they can be considered close to the traditional experimental scientific method or, instead, (...) they possess peculiar and unique features. We argue that this experimental perspective should be taken into account when discussing the status of computing. We critically survey how the experimental method has been conceived and applied in computing, and some open issues that could be tackled with the aid of the history of science, the philosophy of science, and the philosophy of technology. (shrink)

This paper offers an account of what it is for a physical system to be a computing mechanism—a system that performs computations. A computing mechanism is a mechanism whose function is to generate output strings from input strings and (possibly) internal states, in accordance with a general rule that applies to all relevant strings and depends on the input strings and (possibly) internal states for its application. This account is motivated by reasons endogenous to the philosophy of computing, namely, doing (...) justice to the practices of computer scientists and computability theorists. It is also an application of recent literature on mechanisms, because it assimilates computational explanation to mechanistic explanation. The account can be used to individuate computing mechanisms and the functions they compute and to taxonomize computing mechanisms based on their computing power. (shrink)

We give a systematic technical exposition of the foundations of the theory of computably compact metric spaces. We discover several new characterizations of computable compactness and apply these characterizations to prove new results in computable analysis and effective topology. We also apply the technique of computable compactness to give new and less combinatorially involved proofs of known results from the literature. Some of these results do not have computable compactness or compact spaces in their statements, and thus these applications are (...) not necessarily direct or expected. (shrink)

The medium‐independence of computational descriptions has shaped common conceptions of computational explanation. So long as our goal is to explain how a system successfully carries out its computations, then we only need to describe the abstract series of operations that achieve the desired input–output mapping, however they may be implemented. It is argued that this abstract conception of computational explanation cannot be applied to so‐called real‐time computing systems, in which meeting temporal deadlines imposed by the systems with which a (...) device interfaces are constitutive of the computing tasks that a device performs. Instead, real‐time computing reveals the need for alternative conceptions of computational explanation, as well as computational implementation, that eschew medium‐independence. (shrink)