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)

Cloud computing is rapidly gaining traction in business. It offers businesses online services on demand (such as Gmail, iCloud and Salesforce) and allows them to cut costs on hardware and IT support. This is the first paper in business ethics dealing with this new technology. It analyzes the informational duties of hosting companies that own and operate cloud computing datacenters (e.g., Amazon). It considers the cloud services providers leasing ‘space in the cloud’ from hosting companies (e.g, Dropbox, Salesforce). (...) And it examines the business and private ‘clouders’ using these services. The first part of the paper argues that hosting companies, services providers and clouders have mutual informational (epistemic) obligations to provide and seek information about relevant issues such as consumer privacy, reliability of services, data mining and data ownership. The concept of interlucency is developed as an epistemic virtue governing ethically effective communication. The second part considers potential forms of government restrictions on or proscriptions against the development and use of cloud computing technology. Referring to the concept of technology neutrality, it argues that interference with hosting companies and cloud services providers is hardly ever necessary or justified. It is argued, too, however, that businesses using cloud services (banks, law firms, hospitals etc. storing client data in the cloud, e.g.) will have to follow rather more stringent regulations. (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)

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)

The theme of this volume is the multi-faceted 'computational turn' that is occurring through the interaction of the disciplines of philosophy and computing. In computer and information sciences, there are significant conceptual and methodological questions that require reflection and analysis. Moreover, digital, information and communication technologies have had tremendous impact on society, which raises further philosophical questions. This book tries to facilitate the task to continuously work to ensure that its diversity of perspectives and methods proves a source of (...) strength and collaboration rather than a source of instability and disintegration. The first three contributions explore the phenomenon of virtual worlds. The next four focus on robots and artificial agents. Then a group of chapters discusses the relation between human mentality and information processing in computers and the final section covers a broad range of issues at the interface of computers and society. (shrink)

influence. One of the principal characteristics that distinguishes Cognitive Science from more traditional studies of cognition within Psychology, is the extent to which it has been influenced by both the ideas and the techniques of computing. It may come as a surprise to the outsider, then, to discover that there is no unanimity within the discipline on either (a) the nature (and in some cases the desireabilty) of the influence and (b) what computing is –- or at least (...) on its. (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 (...) class='Hi'>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)

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)

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

The mechanistic approach in philosophy of science contributes to our understanding of experimental design. Applying the mechanistic approach to experimentation in computing is beneficial for two reasons. It connects the methodology of experimentation in computing with the methodology of experimentation in established sciences, thereby strengthening the scientific reputability of computing and the quality of experimental design therein. Furthermore, it pinpoints the idiosyncrasies of experimentation in computing: computing deals closely with both natural and engineered mechanisms. Better (...) understanding of the idiosyncrasies, which manifest in terms of a nonstandard role for experimentation, are interesting both for computer scientists and for philosophers of science. Computer scientists can think more clearly about their experimental choices. The role of experimentation elucidated by computer science merits further study from philosophers of science generally, as it highlights a role for experimentation hitherto unrecognized by philosophers: demonstration that activities exist. (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)

Affect plays an important role in the consumer decision-making process and there is growing interest in the development of new technologies and computational approaches that can interpret and recognize the affects of consumers, with benefits for marketing described in relation to both academia and industry. From an interdisciplinary perspective, this paper aims to review past studies focused on electroencephalography (EEG)-based affective computing (AC) in marketing, which provides a promising avenue for studying the mechanisms underlying affective states and developing recognition (...) computational models to predict the psychological responses of customers. This review offers an introduction to EEG technology and an overview of EEG-based AC; provides a snapshot of the current state of the literature. It briefly presents the themes, challenges, and trends in studies of affect evaluation, recognition, and classification; and further proposes potential guidelines for researchers and marketers. (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.

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

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise (...) algorithmic computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers of (...) course to Alan Turing, famous for his explication of the notion of mechanical computation on discrete data such as the integers. The ‘Newton’ there has to do to with the well known numerical method due to Isaac Newton for approximating the zeros of continuous functions under suitable conditions that is taken to be a paradigm of scientific computing. Finally, the meaning of “Turing meets Newton” in the title of Blum’s article has another, more particular aspect: in connection with the problem of controlling errors in the numerical solution of linear equations and inversion of matrices,Turing (1948) defined a notion of condition for the relation of changes in the output of a computation due to small changes in the input that is analogous to Newton’s definition of the derivative. The thrust of Blum’s 2004 article was that the BSS model of computation on the reals is the appropriate foundation for scientific computing in general. By way of response, two years later another very interesting and equally readable article appeared in the Notices, this time by Mark Braverman and Stephen Cook (2006) entitled “Computing over the reals: Foundations for scientific computing,” in which the authors argued that the requisite foundation is provided by a quite different “bit computation” model, that is in fact prima facie incompatible with the BSS model. The bit computation model goes back to ideas due to Stefan Banach and Stanislaw Mazur in the latter part of the 1930s, but the first publication was not made until Mazur (1963).. (shrink)

Precision agriculture is a breakthrough in digital farming technology, which facilitates the application of precise and exact amount of input level of water and fertilizer to the crop at the required time for increasing the yield. Since agriculture relies on direct rainfall than irrigation and the prediction of rainfall date is easily available from web source, the integration of rainfall prediction with precision agriculture helps to regulate the water consumption in farms. In this work, an edge computing model is (...) developed for predicting soil moisture in real time and managing the water usage in accordance with rain prediction. A soil moisture prediction hybrid algorithm has been developed that revolves around the decision-making techniques with live environmental parameters including weather parameters for the prediction of soil moisture through the impact of precipitation. Numerous algorithms with the combination of regression + clustering are estimated, and it is inferred that XGBoost + k-means outperforms other algorithmic combinations that is deployed in edge model. This model is used as an intermediary between the end IoT devices and cloud that results in the saving of computationally intensive processing performed on cloud servers. The servers located on a local edge network perform the developed algorithmic computations. Avoiding transmission over the cloud results in significant latency, response time, and computation power savings and therefore increases the efficiency of data transfer. The proposed edge computing model is implemented in Raspberry Pi as an edge, Heroku as cloud, and edge nodes as the combination of Pi with actuators and sensors. The monitored data from Pi are stored in MongoDB webserver that is controlled by Web dashboard. Finally, the developed model is implemented in cloud and edge where the edge server implementation performs better in terms of latency, bandwidth, throughput, response time, and CPU memory usage. (shrink)

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)

The emergence of vibrant research communities of computer scientists in Kenya and Uganda has occurred in the context of neoliberal privatization, commercialization, and transnational capital flows from donors and corporations. We explore how this funding environment configures research culture and research practices, which are conceptualized as two main components of a research community. Data come from a three-year longitudinal study utilizing interview, ethnographic and survey data collected in Nairobi and Kampala. We document how administrators shape research culture by building academic (...) programs and training growing numbers of PhDs, and analyze how this is linked to complicated interactions between political economy, the epistemic nature of computer science and sociocultural factors like entrepreneurial leadership of key actors and distinctive cultures of innovation. In a donor-driven funding environment, research practice involves scientists constructing their own localized research priorities by adopting distinctive professional identities and creatively structuring projects. The neoliberal political economic context thus clearly influenced research communities, but did not debilitate computing research capacity nor leave researchers without any agency to carry out research programs. The cases illustrate how sites of knowledge production in Africa can gain some measure of research autonomy, some degree of global competency in a central arena of scientific and technological activity, and some expression of their regional cultural priorities and aspirations. Furthermore, the cases suggest that social analysts must balance structure with culture, place and agency in their approaches to understanding how funding and political economy shape scientific knowledge. (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.

Various threshold Boolean networks, a formalism used to model different types of biological networks, can produce similar dynamics, i.e. share same behaviors. Among them, some are complex, others not. By computing both structural and behavioral complexities, we show that most TBNs are structurally complex, even those having simple behaviors. For this purpose, we developed a new method to compute the structural complexity of a TBN based on estimates of the sizes of equivalence classes of the threshold Boolean functions composing (...) the TBN. (shrink)

Knowledge representation (KR) is actually more than representation: It involves also inference, namely inference of “new” knowledge, i.e. new facts. Logic programming is a suitable KR medium, but more often than not discussions on this programming paradigm focus on aspects other than KR. In this paper, I elaborate on the general theory of logic programming and give the essentials of two of its main implementations, to wit, Prolog and Datalog, from the viewpoint of deductive computing over knowledge bases, which (...) includes deductive programming. (shrink)

In a future world of ubiquitous computing, in which humans interact with computerized technologies even more frequently and in even more situations than today, interface design will have increased importance. One feature of interface that I argue will be especially relevant is what I call abstract relational strategies. This refers to an approach (in both a bodily and conceptual sense) toward the use of a technology, an approach that is general enough to be applied in many different concrete scenarios. (...) Such an abstract manner of approach is relevant, for example, when an interface design for a device to which users are already accustomed is applied to an entirely different device (such as a device used for a completely different purpose). To articulate this idea, I explore the history of keyboards, and consider how the habits of interface with one kind (e.g., piano keyboards) have historically enabled some users to approach other technologies fitted with similar keyboard interface (e.g., typewriters, electronic instrumentation). I conclude by brainstorming ways that abstract relational strategies, applicable to a variety of different devices, will have increased importance in a future world in which computing is even more ubiquitous than today. (shrink)

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)

"The Rules" are found in a collaborative document that states principles for responsibility when a computer artifact is designed, developed and deployed into a sociotechnical system. At this writing, over 50 people from nine countries have signed onto The Rules. Unlike codes of ethics, The Rules are not tied to any organization, and computer users as well as computing professionals are invited to sign onto The Rules. The emphasis in The Rules is that both users and professionals have responsibilities (...) in the production and use of computing artifacts. In this paper, we use The Rules to examine issues of trust. (shrink)