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)

The aim of this paper is to begin developing a version of Gualtiero Piccinini’s mechanistic account of computation that does not need to appeal to any notion of proper functions. The motivation for doing so is a general concern about the role played by proper functions in Piccinini’s account, which will be evaluated in the first part of the paper. I will then propose a potential alternative approach, where computing mechanisms are understood in terms of Carl Craver’s perspectival account (...) of mechanistic functions. According to this approach, the mechanistic function of ‘performing a computation’ can only be attributed relative to an explanatory perspective, but such attributions are nonetheless constrained by the underlying physical structure of the system in question, thus avoiding unlimited pancomputationalism. If successful, this approach would carry with it fewer controversial assumptions than Piccinini’s original account, which requires a robust understanding of proper functions. Insofar as there are outstanding concerns about the status of proper functions, this approach would therefore be more generally acceptable. (shrink)

I propose to consider the question, "Can machines think?" This should begin with definitions of the meaning of the terms "machine" and "think." The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words "machine" and "think" are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to (...) the question, "Can machines think?" is to be sought in a statistical survey such as a Gallup poll. But this is absurd. Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words. The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B. We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?". (shrink)

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

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)

PurposeThe purpose of this paper is to present a four component model of ethical behavior that integrates literature in moral psychology, computing ethics, and virtue ethics as informed by research on moral exemplars in computing. This is part 2 of a two part contribution, part 1 having appeared in Vol. 6 No. 3.Design/methodology/approachThis psychologically based and philosophically informed model argues that moral action is grounded in relatively stable personality characteristics, guided by integration of morality into the self‐system, shaped (...) by the context of the surrounding moral ecology, and facilitated by morally relevant skills and knowledge.FindingsThe model seeks to explain the daily successful (and unsuccessful) performance of moral action by computing professionals and to provide groundwork for a pedagogy that emphasizes ethically effective performance.Practical implicationsThe model has significant implications for how ethical action to computer professionals and other design professionals might be taught. It also makes recommendations about what need to be measured to construct a complete picture of sustained ethical action in a profession.Originality/valueMost accepted models of ethical behavior are unidimensional, emphasizing either principled reasoning or a simplistic model of integrity/character. This model brings together a variety of disparate literatures in the light of its emphasis on sustained moral action in the profession. It thereby provides researchers and educators with a picture of what is needed to construct a complete understanding of moral action in the profession. (shrink)

Collecting, comparing, and computing molecular sequences are among the most prevalent practices in contemporary biological research. They represent a specific way of producing knowledge. This paper explores the historical development of these practices, focusing on the work of Margaret O. Dayhoff, Richard V. Eck, and Robert S. Ledley, who produced the first computer-based collection of protein sequences, published in book format in 1965 as the Atlas of Protein Sequence and Structure. While these practices are generally associated with the rise (...) of molecular evolution in the 1960s, this paper shows that they grew out of research agendas from the previous decade, including the biochemical investigation of the relations between the structures and function of proteins and the theoretical attempt to decipher the genetic code. It also shows how computers became essential for the handling and analysis of sequence data. Finally, this paper reflects on the relationships between experimenting and collecting as two distinct “ways of knowing” that were essential for the transformation of the life sciences in the twentieth century. (shrink)

According to the conventional wisdom, Turing said that computing machines can be intelligent. I don't believe it. I think that what Turing really said was that computing machines –- computers limited to computing –- can only fake intelligence. If we want computers to become genuinelyintelligent, we will have to give them enough “initiative” to do more than compute. In this paper, I want to try to develop this idea. I want to explain how giving computers more ``initiative'' (...) can allow them to do more than compute. And I want to say why I believe that they will have to go beyond computation before they can become genuinely intelligent. (shrink)

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

Experimentation represents today a ‘hot’ topic in computing. If experiments made with the support of computers, such as computer simulations, have received increasing attention from philosophers of science and technology, questions such as “what does it mean to do experiments in computer science and engineering and what are their benefits?” emerged only recently as central in the debate over the disciplinary status of the discipline. In this work we aim at showing, also by means of paradigmatic examples, how the (...) traditional notion of controlled experiment should be revised to take into account a part of the experimental practice in computing along the lines of experimentation as exploration. Taking inspiration from the discussion on exploratory experimentation in the philosophy of science—experimentation that is not theory-driven—we advance the idea of explorative experiments that, although not new, can contribute to enlarge the debate about the nature and role of experimental methods in computing. In order to further refine this concept we recast explorative experiments as socio-technical experiments, that test new technologies in their socio-technical contexts. We suggest that, when experiments are explorative, control should be intended in a posteriori form, in opposition to the a priori form that usually takes place in traditional experimental contexts. (shrink)

With technologies like machine learning and data analytics being deployed as privileged means to improve how contemporary bureaucracies work, many governments around the world have turned to artificial intelligence as a tool of statecraft. In that context, our paper uses Canada as a critical case to investigate the relationship between ideals of good government and good technology. We do so through not one, but two Trudeaus—celebrity Prime Minister Justin Trudeau (2015—…) and his equally famous father, former Prime Minister Pierre Elliott (...) Trudeau (1968–1979, 1980–1984). Both shared a similar interest in new ideas and practices of both intelligent government and artificial intelligence. Influenced by Marshall McLuhan and his media theory, Pierre Elliott Trudeau deployed new communication technologies to restore centralized control in an otherwise decentralized state. Partly successful, he left his son with an informationally inclined political legacy, which decades later animated Justin Trudeau's own turn toward Big Data and artificial intelligence. Compared with one another, these two visions for both government and artificial intelligence illustrate the broader tensions between cybernetic and neoliberal approaches to government, which inform how new technologies are conceived of, and adopted, as political ones. As this article argues, Canada offers a paradigmatic case for how artificial intelligence is as much shaped by theories of government as by investments and innovations in computing research, which together delimit the contours of intelligence by defining which technical systems, people, and organizations come to be recognized as its privileged bearers. (shrink)

PurposeThe purpose of this paper is to describe some of the methodological challenges of investigating privacy and ubiquitous computing in the home, particularly among the healthy elderly.Design/methodology/approachThe paper is based on focus groups with 60 senior citizens either living independently or in an assisted living facility. Prototypes of home‐based ubiquitous computing devices were created and deployed in a home‐like living lab setting; elders were brought to the lab to interact with the prototypes, then brought together in focus groups (...) to discuss their insights and concerns.FindingsInitial analyses suggest that extant metaphors of privacy may be inadequate for understanding pervasive computing in the home. Concepts of data, affective concerns, and the creation of appropriate prototypes for eliciting privacy are considered. Considerations for future studies of the elderly and privacy are made.Research limitations/implicationsThe homogeneity of the study population in terms of socioeconomic status, location, and community networks suggests that the study needs to be repeated with wider populations.Originality/valueAlthough a number of projects and studies have examined the usability of home‐based ubiquitous computing and design for aging, there has been little integration of privacy and ethical concerns into general research discourse. (shrink)

This paper continues the power ordering approach to verisimilitude. We define a parameterized verisimilar ordering of theories in the finite propositional case, both semantically and syntactically. The syntactic definition leads to an algorithm for computing verisimilitude. Since the power ordering approach to verisimilitude can be translated into a standard notion of belief revision, the algorithm thereby also allows the computation of membership of a belief-revised theory.

This article shows how common morality can be helpful in clarifying the discussion of ethical issues that arise in computing. Since common morality does not always provide unique answers to moral questions, not all such issues can be resolved, however common morality does provide a clear answer to the question whether one can illegally copy software for a friend.

'Affective computing' is a branch of computing concerned with the theory and construction of machines which can detect, respond to, and simulate human emotional states. This book presents an interdisciplinary exploration of this rapidly expanding field, aimed at those in psychology, computational neuroscience, computer science, and AI. A Blueprint for Affective Computing: A sourcebook and manual is the very first attempt to ground affective computing within the disciplines of psychology, affective neuroscience, and philosophy. This book illustrates (...) the contributions of each of these disciplines to the development of the ever-growing field of affective computing. In addition, it demonstrates practical examples of cross-fertilization between disciplines in order to highlight the need for integration of computer science, engineering and the affective sciences. (shrink)

In the last half century we have gone from storing data on 5-1/4 inch floppy diskettes to cloud and now fog computing. But one should ask why so much data is being collected. Part of the answer is simple in light of scientific projects but why is there so much data on us? Then, we ask about its “interface” through fog computing. Such questions prompt this chapter on the philosophy of big data and fog computing. After some (...) background on definitions, origins and contemporary applications, the main discussion begins with thinking about modern data collection, management, and applications from a complexity standpoint. Big data is turned into knowledge but knowledge is extrapolated from the past and used to manage the future. Yet it is questionable whether humans have the capacity to manage contemporary technological and social complexity evidenced by our world in crisis and possibly on the brink of extinction. Such calls for a new way of studying societies from a scientific point of view. We are at the center of the observation from which big data emerge and are manipulated, the overall human project being not only to create an artificial brain with an attendant mind but a society that might be able to survive what “natural” humans cannot. (shrink)

Query processing in ground definite deductive is known to correspond precisely to a linear programming problem. However, the “groundedness” requirement is a huge drawback to using linear programming techniques for logic program computations because the ground version of a logic program can be very large when compared to the original program. Furthermore, when we move from propositional logic programs to first-order logic programs, this effectively means that functions symbols may not occur in clauses. In this paper, we develop a theory (...) of “instantiate- by-need” that performs instantiations only when needed. We prove that this method is sound and complete when computing answer substitutions for non-ground logic programs including those containing function symbols. More importantly, when taken in conjunction with Colmerauer's result that unification can be viewed as linear programming, this means that resolution with unification can be completely replaced by linear programming as an operational paradigm. Additionally, our tree construction method is not rigidly tied to the linear programming paradigm-we will show that given any method M that can compute the set of atomic logical consequences of a propositional logic program, our method can use M to compute , the set of all atoms that are consequences of a first-order logic program. (shrink)

According to the conventional wisdom, Turing (1950) said that computing machines can be intelligent. I don't believe it. I think that what Turing really said was that computing machines –- computers limited to computing –- can only fake intelligence. If we want computers to become genuinelyintelligent, we will have to give them enough “initiative” (Turing, 1948, p. 21) to do more than compute. In this paper, I want to try to develop this idea. I want to explain (...) how giving computers more ``initiative'' can allow them to do more than compute. And I want to say why I believe (and believe that Turing believed) that they will have to go beyond computation before they can become genuinely intelligent. (shrink)

Cognitive science has been dominated by the computational conception that cogniton is computation across representations. To the extent to which cognition is supposed to be a purposive, meaningful, algorithmic, problem-solving activity, however, computers appear to be incapable of cognition. They are devices that can facilitate computations on the basis of semantic grounding relations as special kinds of signs. Even their algorithmic, problem-solving character arises from ther interpretation by human users. Strictly speaking, computers as such–apart from human users–are not only incapable (...) of cognition but even incapable of computation, properly construed. If we want to understand the nature of thought, we are going to have to study thinking, not computing, because they are not the same thing. (shrink)

Affective computing research has advanced emotion recognition systems using facial expressions, voices, gaits, and physiological signals, yet these methods are often impractical. This study integrates mouse cursor motion analysis into affective computing and investigates the idea that movements of the computer cursor can provide information about emotion of the computer user. We extracted 16–26 trajectory features during a choice-reaching task and examined the link between emotion and cursor motions. Participants were induced for positive or negative emotions by music, (...) film clips, or emotional pictures, and they indicated their emotions with questionnaires. Our 10-fold cross-validation analysis shows that statistical models formed from “known” participants could predict nearly 10%–20% of the variance of positive affect and attentiveness ratings of “unknown” participants, suggesting that cursor movement patterns such as the area under curve and direction change help infer emotions of computer users. (shrink)

Like other mathematically intensive sciences, economics is becoming increasingly computerized. Despite the extent of the computation, however, there is very little true simulation. Simple computation is a form of theory articulation, whereas true simulation is analogous to an experimental procedure. Successful computation is faithful to an underlying mathematical model, whereas successful simulation directly mimics a process or a system. The computer is seen as a legitimate tool in economics only when traditional analytical solutions cannot be derived, i.e., only as a (...) purely computational aid. We argue that true simulation is seldom practiced because it does not fit the conception of understanding inherent in mainstream economics. According to this conception, understanding is constituted by analytical derivation from a set of fundamental economic axioms. We articulate this conception using the concept of economists' perfect model. Since the deductive links between the assumptions and the consequences are not transparent in ‘bottom‐up’ generative microsimulations, microsimulations cannot correspond to the perfect model and economists do not therefore consider them viable candidates for generating theories that enhance economic understanding. (shrink)

Purpose: Commenting on the transcript of a lecture. Findings: The document reconstructs the development of the original 1973 lecture by Heinz von Foerster into his best-known paper, On Constructing a Reality. Many aspects of that paper can be identified as being shaped through interaction with the audience. Implications: The lecture documented here was a forerunner of a central paper in constructivism.

This paper investigates ontological dimensions of the blockchain by asking what kind of socio-technical object bitcoin is. It discusses both blockchain's political qualities and the political forms enabled by its emergence. It first observes recent approaches to the ontology of money and the political qualities of the ledgers used by the current fractional reserve banking model. It then directs the same questions at blockchain technology. The paper discusses an ontology proposed by Ole Bjerg and argues in favour of a mixed-ontology (...) approach to blockchains. It then questions the political qualities of the distributed ledger as a digital object and highlights the apparent absence of authority figures in the model. Finally, it argues that the political ontology of the blockchain can be framed as the displacement of authority from institutional actors into instrumental control of trust, in a dynamically distributed environment. (shrink)

In this article we present a new kind of computing device that uses biochemical reactions networks as building blocks to implement logic gates. The architecture of a computing machine relies on these generic and composable building blocks, computation units, that can be used in multiple instances to perform complex boolean functions. Standard logical operations are implemented by biochemical networks, encapsulated and insulated within synthetic vesicles called protocells. These protocells are capable of exchanging energy and information with each other (...) through transmembrane electron transfer. In the paradigm of computation we propose, protoputing, a machine can solve only one problem and therefore has to be built specifically. Thus, the programming phase in the standard computing paradigm is represented in our approach by the set of assembly instructions that directs the wiring of the protocells that constitute the machine itself. To demonstrate the computing power of protocellular machines, we apply it to solve a NP-complete problem, known to be very demanding in computing power, the 3-SAT problem. We show how to program the assembly of a machine that can verify the satisfiability of a given boolean formula. Then we show how to use the massive parallelism of these machines to verify in less than 20 min all the valuations of the input variables and output a fluorescent signal when the formula is satisfiable or no signal at all otherwise. (shrink)

Wilfred Sieg and Rosella Lupiccini. Computing Machines: Entry for the Second Edition of the Encyclopedia of Philsophy.

Internet of Things is expanding and evolves into all aspects of the society. Research and developments in the field of IoT have shown the possibility of producing huge volume of data and computation among different devices of the IoT. The data collected from IoT devices are transferred to a central server which can further be retrieved and accessed by the service providers for analyzing, processing, and using. Industrial Internet of Health Things is the expansion of the Internet of Health Things (...) which plays an important role in observing, consulting, monitoring, and treatment process of remote exchange data processes. The linkage of computation and interoperability are supported through various intelligent sensors, controllers, and actuators. The role of parallel computing for efficient and Intelligent Industrial Internet of Health Things is obvious to analyze and process different healthcare situations. A detailed overview of this existing literature is needed through which the research community will provide new solutions for efficient healthcare with the help of IoT based on parallel computing. Therefore, the current study presents a detailed overview of the existing literature for facilitating IIoHT. (shrink)

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)

Affective computing adopts a computational approach to study affect. We highlight the AC approach towards automated affect measures that jointly model machine-readable physiological/behavioral signals with affect estimates as reported by humans or experimentally elicited. We describe the conceptual and computational foundations of the approach followed by two case studies: one on discrimination between genuine and faked expressions of pain in the lab, and the second on measuring nonbasic affect in the wild. We discuss applications of the measures, analyze measurement (...) accuracy and generalizability, and highlight advances afforded by computational tipping points, such as big data, wearable sensing, crowdsourcing, and deep learning. We conclude by advocating for increasing synergies between AC and affective science and offer suggestions toward that direction. (shrink)

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if κ≤λ, then sup ‖M‖=λ|Sκ|=|)κ. We show that this holds for any abstract elementary class with λ-amalgamation. No such calculation is possible for nonalgebraic types. However, we introduce a subclass of nonalgebraic types for which the same upper bound holds.

Researchers in artificial intelligence and robotics often include a timeline stretching into the future in which they predict the convergence between human and artificial intelligence. Ray Kurzweil, for example, predicts that in a mere 100 years humans and intelligent machines will become indistinguishable from one another, both ceasing to have permanent corporeal forms. This article argues that the one thing we can know for sure about the future is that when it arrives, it will be different from what we imagined. (...) The cultural work that predictions like Kurzweil’s perform is less to prognosticate the future than to shape our understanding of what it means to be human in the present. Working from the ‘sense-think-act’ paradigm foundational to work in artificial intelligence and robotics, this article argues that predictions in all three areas feed back to affect how the human is envisioned in the present. The reconfigurations these predictions bring about are to downplay consciousness, embodied cognition, and evolutionary inertia. The article concludes by critically evaluating contemporary resistances to the posthuman, especially in the writings of Rodney Brooks and Francis Fukuyama. (shrink)

This book is about nature considered as the totality of physical existence, the universe, and our present day attempts to understand it.

Artificial Intelligence (AI) is a technology widely used to support human decision-making. Current areas of application include financial services, engineering, and management. A number of attempts to introduce AI decision support systems into areas which more obviously include moral judgement have been made. These include systems that give advice on patient care, on social benefit entitlement, and even ethical advice for medical professionals. Responding to these developments raises a complex set of moral questions. This paper proposes a clearer replacement question (...) to them. The replacement question asks under what circumstances, if any, people would accept a moral judgement made by some sort of machine. Since, it is argued, the answer to this replacement question is positive, urgent practical moral problems are raised. (shrink)

Minds, Brains and Biology -- A Body of Knowledge -- Towards an Aesthetics of Behavior.

The classical view of computing positions computation as a closed-box transformation of inputs (rational numbers or finite strings) to outputs. According to the interactive view of computing, computation is an ongoing interactive process rather than a function-based transformation of an input to an output. Specifically, communication with the outside world happens during the computation, not before or after it. This approach radically changes our understanding of what is computation and how it is modeled. The acceptance of interaction as (...) a new paradigm is hindered by the Strong Church–Turing Thesis (SCT), the widespread belief that Turing Machines (TMs) capture all computation, so models of computation more expressive than TMs are impossible. In this paper, we show that SCT reinterprets the original Church–Turing Thesis (CTT) in a way that Turing never intended; its commonly assumed equivalence to the original is a myth. We identify and analyze the historical reasons for the widespread belief in SCT. Only by accepting that it is false can we begin to adopt interaction as an alternative paradigm of computation. We present Persistent Turing Machines (PTMs), that extend TMs to capture sequential interaction. PTMs allow us to formulate the Sequential Interaction Thesis, going beyond the expressiveness of TMs and of the CTT. The paradigm shift to interaction provides an alternative understanding of the nature of computing that better reflects the services provided by today’s computing technology. (shrink)

Both Higher-Order Uni cation approaches to In linguistic theories on discourse coherence Kehler, discourse semantics Dalrymple et al., 1991; Shieber et.

Intelligent tutoring system (ITS) is a computer system which aims to provide immediate and customized or reactions to learners, usually without the intervention of human teacher's instructions. Secretariats professional to have the common goal of learning a meaningful and effective manner through the use of a variety of computing technologies enabled. There are many examples of professional Secretariats used in both formal education and in professional settings that have proven their capabilities. There is a close relationship between private lessons (...) intelligent, cognitive learning and design theories; and there are ongoing to improve the effectiveness of ITS research. And it aims to find a solution to the problem of over-reliance on students' teachers for quality education. The program aims to provide access to high-quality education to every student, and therefore the reform of the education system as a whole. In this paper, we will use Intelligent Tutoring System Builder (ITSB) to build an education system on cloud computing in terms of the concept of cloud computing and components and how to take advantage of cloud computing in the field. (shrink)