In this work, a virtual submerged floating operational system based on parallel and serial robotic platforms is proposed. The primary aim behind its development lies in carrying out simulated underwater manipulation experiments in an easier and safer way. This VSFOS is consisted of a six-degree-of-freedom parallel platform, an ABB serial manipulator, an inertial sensor, and a real-time industrial computer. The 6-DOF platform is used to simulate the movement of an underwater vehicle, whose attitude is measured by the inertial sensor. The (...) ABB manipulator, controlled by the real-time industrial computer, works as an operational tool to perform underwater manipulation tasks. In the control system architecture, software is developed to receive the data collected by the inertial sensor, to communicate and send instructions. Furthermore, the real-time status of the manipulator is displayed in this software. To validate the proposed system, two experiments have been conducted to test its performance. In the first experiment, the test is carried out to check the communication function of VSFOS, while in the second one, the manipulator is intended to follow the movement of the parallel platform and perform simulated operational task in the space. The obtained results from these two experiments show clearly the effectiveness and the performance of the proposed VSFOS. (shrink)

The functional capabilities that consciousness seems to provide to biological systems can supply valuable principles in the design of more autonomous and robust technical systems. These functional concepts keep a notable similarity to those underlying the notion of operating system in software engineering, which allows us to specialize the computer metaphor for the mind into that of the operating system metaphor for consciousness. In this article, departing from these ideas and a model-based theoretical framework for cognition, (...) we present an architectural proposal for machine consciousness, called the Operative Mind. According to it, machine consciousness could be implemented as a set of services, in an operative system fashion, based on modeling of the own control architecture, that supervise the adequacy of the system architectural structure to the current objectives, triggering and managing adaptativity mechanisms. (shrink)

This work focuses on the application of machine learning techniques to assist the clinicians in the administration of analgesic drug during general anaesthesia. Specifically, the main objective is to propose the basis of an intelligent system capable of making decisions to guide the opioid dose changes based on a new nociception monitor, the analgesia nociception index. Clinical data were obtained from 15 patients undergoing cholecystectomy surgery. By means of an off-line study, machine learning techniques were applied to analyse the possible (...) relationship between the analgesic dose changes performed by the physician due to the hemodynamic activity of the patients and the evolution of the ANI. After training different classifiers and testing the results under cross validation, a preliminary relationship between the evolution of ANI and the dosage of remifentanil was found. These results evidence the potential of the ANI as a promising index to guide the infusion of analgesia. (shrink)

Focused on city-scale automation, and using self-driving cars (SDCs) as a case study, this article reflects on the role of AI—and in particular, computer vision systems used for mapping and navigation—as a catalyst for urban transformation. Urban research commonly presents AI and cities as having a one-way cause-and-effect relationship, giving undue weight to AI’s impact on cities and overlooking the role of cities in shaping AI. Working at the intersection of data science and social research, this paper aims to (...) counter this trend by exploring the reverse perspective: how do cities affect the development, and expose the present limits, of SDCs? The contribution of this paper is threefold. First, by comparing urban and nonurban environments and thoroughly examining the relationship between computer vision and city-specific sociality and form, it defines machine autonomy/automation as a function of the sociotechnical milieu in which an AI system operates. Second, and related, the paper problematizes the notion of SDCs as autonomous technologies and the role it plays in envisioning contending policy arrangements and technical solutions for achieving full driving automation. Finally, the article offers insight into a materialist and spatialized understanding of AI—namely, not as an abstract quality susceptible to replication within discrete machines, but rather as a distributed property emerging through embodied interactions among a multiplicity of agents (human, non-human, and technological) within/with their environments. (shrink)

What we have learnt in the last six or seven decades about virtual machinery, as a result of a great deal of science and technology, enables us to offer Darwin a new defence against critics who argued that only physical form, not mental capabilities and consciousness could be products of evolution by natural selection. The defence compares the mental phenomena mentioned by Darwin’s opponents with contents of virtual machinery in computing systems. Objects, states, events, and processes in virtual machinery (...) which we have only recently learnt how to design and build, and could not even have been thought about in Darwin’s time, can interact with the physical machinery in which they are implemented, without being identical with their physical implementation, nor mere aggregates of physical structures and processes. The existence of various kinds of virtual machinery (including both “platform” virtual machines that can host other virtual machines, e.g. operating systems, and “application” virtual machines, e.g. spelling checkers, and computer games) depends on complex webs of causal connections involving hardware and software structures, events and processes, where the specification of such causal webs requires concepts that cannot be defined in terms of concepts of the physical sciences. That indefinability, plus the possibility of various kinds of self-monitoring within virtual machinery, seems to explain some of the allegedly mysterious and irreducible features of consciousness that motivated Darwin’s critics and also more recent philosophers criticising AI. There are consequences for philosophy, psychology, neuroscience and robotics. (shrink)

The purpose of this article is to provide a multi-perspective examination of one of the most important contemporary security issues: weaponized, and especially lethal, artificial intelligence. This technology is increasingly associated with the approaching dramatic change in the nature of warfare. What becomes particularly important and evermore intensely contested is how it becomes embedded with and concurrently impacts two social structures: ethics and law. While there has not been a global regime banning this technology, regulatory attempts at establishing a ban (...) have intensified along with acts of resistance and blocking coalitions. This article aims to reflect on the prospects and limitations, as well as the ethical and legal intensity, of the emerging regulatory framework. To allow for such an investigation, a power-analytical approach to studying international security regimes is utilized. (shrink)

In this paper we will demonstrate that a computational system can meet the criteria for autonomy laid down by classical enactivism. The two criteria that we will focus on are operational closure and structural determinism, and we will show that both can be applied to a basic example of a physically instantiated Turing machine. We will also address the question of precariousness, and briefly suggest that a precarious Turing machine could be designed. Our aim in this paper is to challenge (...) the assumption that computational systems are necessarily heteronomous systems, to try and motivate in enactivism a more nuanced and less rigid conception of computational systems, and to demonstrate to computational theorists that they might find some interesting material within the enactivist tradition, despite its historical hostility towards computationalism. (shrink)

The Language of Thought program has a suicidal edge. Jerry Fodor, of all people, has argued that although LOT will likely succeed in explaining modular processes, it will fail to explain the central system, a subsystem in the brain in which information from the different sense modalities is integrated, conscious deliberation occurs, and behavior is planned. A fundamental characteristic of the central system is that it is “informationally unencapsulated” -- its operations can draw from information from any cognitive domain. The (...) domain general nature of the central system is key to human reasoning; our ability to connect apparently unrelated concepts enables the creativity and flexibility of human thought, as does our ability to integrate material across sensory divides. The central system is the holy grail of cognitive science: understanding higher cognitive function is crucial to grasping how humans reach their highest intellectual achievements. But according to Fodor, the founding father of the LOT program and the related Computational Theory of Mind (CTM), the holy grail is out of reach: the central system is likely to be non-computational (Fodor 1983, 2000, 2008). Cognitive scientists working on higher cognitive function should abandon their efforts. Research should be limited to the modules, which for Fodor rest at the sensory periphery (2000).1 Cognitive scientists who work in the symbol processing tradition outside of philosophy would reject this pessimism, but ironically, within philosophy itself, this pessimistic streak has been very influential, most likely because it comes from the most well-known proponent of LOT and CTM. Indeed, pessimism about centrality has become assimilated into the mainstream conception of LOT. (Herein, I refer to a LOT that appeals to pessimism about centrality as the “standard LOT”). I imagine this makes the standard LOT unattractive to those philosophers with a more optimistic approach to what cognitive science can achieve.. (shrink)

This paper introduces a formal concept of ideology and ideological system. The formalization takes ideologies and ideological systems to be situated in agent societies. An ideological system is defined as a system of operations able to create, maintain, and extinguish the ideologies adopted by the social groups of agent societies. The concepts of group ideology, ideological contradiction, ideological dominance, and dominant ideology of an agent society, are defined. An ideology-based concept of social group is introduced. Relations between the proposed (...) formal concept of ideology and the classical concepts of ideology elaborated in social sciences are examined. A computational notation is presented, to support the realization of ideological systems in computationally implemented agent societies. The adequacy of the approach for the formal modeling and analysis of ideological issues is illustrated through three case studies. (shrink)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division (...) of the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

To shorten the travel time and improve comfort, the automatic train driving system is considered to replace manual driving. In this article, an automatic control method of computer application data-processing system based on artificial intelligence is proposed. An automatic train operation (ATO) introduced the structure and function of an autopilot system (train), optimized the train running on the target curve, introduced the basic principle of fuzzy generalized predictive control (PC) algorithm, and combined with the characteristics of ATO system design the (...) speed controller based on optimization algorithm, the target curve to make use of the designed controller to track and simulation validation. The experimental outcomes demonstrate that when the train runs to 90 s, the displacement difference reaches about 40 m, which proves that the fuzzy PC has better displacement tracking, punctual arrival, and higher stopping accuracy. (shrink)

We show that in Kabbalah, the esoteric teaching of Judaism, there were developed ideas of unconventional automata in which operations over characters of the Hebrew alphabet can simulate all real processes producing appropriate strings in accordance with some algorithms. These ideas may be used now in a syllogistic extension of Lindenmayer systems, where we deal also with strings in the Kabbalistic-Leibnizean meaning. This extension is illustrated by the behavior of Physarum polycephalum plasmodia which can implement, first, the Aristotelian syllogistic (...) and, second, a Talmudic syllogistic by qal wa-homer. (shrink)

This paper introduces a formal concept of ideology and ideological system. The formalization takes ideologies and ideological systems to be situated in agent societies. An ideological system is defined as a system of operations able to create, maintain, and extinguish the ideologies adopted by the social groups of agent societies. The concepts of group ideology, ideological contradiction, ideological dominance, and dominant ideology of an agent society, are defined. An ideology-based concept of social group is introduced. Relations between the proposed (...) formal concept of ideology and the classical concepts of ideology elaborated in social sciences are examined. A computational notation is presented, to support the realization of ideological systems in computationally implemented agent societies. The adequacy of the approach for the formal modeling and analysis of ideological issues is illustrated through three case studies. (shrink)

This paper introduces a formal concept of ideology and ideological system. The formalization takes ideologies and ideological systems to be situated in agent societies. An ideological system is defined as a system of operations able to create, maintain, and extinguish the ideologies adopted by the social groups of agent societies. The concepts of group ideology, ideological contradiction, ideological dominance, and dominant ideology of an agent society, are defined. An ideology-based concept of social group is introduced. Relations between the proposed (...) formal concept of ideology and the classical concepts of ideology elaborated in social sciences are examined. A computational notation is presented, to support the realization of ideological systems in computationally implemented agent societies. The adequacy of the approach for the formal modeling and analysis of ideological issues is illustrated through three case studies. (shrink)

To study the static software defect detection system, based on the traditional static software defect detection system design, a new static software defect detection system design based on big data technology is proposed. The proposed method can optimize the distribution of test resources and improve the quality of software products by predicting the potential defect program modules and design the software and hardware of the static software defect detection system of big data technology. It is found that the traditional static (...) software defect detection system design based on code source data takes a long time, averaging 65 h /day. However, the traditional static software defect detection system based on deep learning has a short detection time, averaging 35 h/day. In this article, the detection time of the static software defect detection system based on big data is shorter than that of the other two traditional system designs, with an average of 15 h/day. Because the system design adjusts the operating state of the system, it improves the accuracy of data operation. On the premise of data collection, the system inspection research is completed, which ensures the operational safety of software data, alleviates the contradiction between system and data to a high degree, improves the efficiency of system operation, reduces unnecessary operations, further shortens the time required for inspection, improves the system performance, and has higher research and operation value. (shrink)

Based on the existing financial system risk models, a set of time-lag financial system risk models is established considering the influence brought by time-lag factors on the financial risk system, and the dynamical behavior of this system is analyzed by using chaos theory. Through Matlab simulation, the bifurcation diagram and phase diagram of time-lag risk intensity and control intensity are plotted. The analysis shows that this kind of time-lag financial system risk model has complex dynamic behavior, different motion states will (...) appear when different parameter values are selected, and the time-lag risk intensity parameter also has a very strong influence on the system motion. To ensure the operation of the financial system in a stable state, measures with certain delay effects must be taken to control the risk and to choose the appropriate time-lag control intensity, and too much or too little time-lag control intensity is not conducive to the benign operation of the system. (shrink)

This book presents a systematic philosophical and historical analysis of operating systems (0S). The discussion starts with the evolution of OSs since before their birth. It continues with a comprehensive philosophical analysis grounded in technical aspects. Coverage looks at software and (where appropriate) hardware as well as their historical developments. The authors not only offer historical and philosophical reflections on operating systems. They also explore the programs they coordinate and trace the epsitemic and ontological consequences of (...) their designs. Each chapter investigates one or more overlapping fragments of this fascinating history. These include: the birth of the UNIX system and the development of early systems and prototypes; a conceptual analysis of the plurality of systems; an investigation into business, ethical, and aesthetics aspects related to operating systems; and logical principles of formal languages. This book will interest researchers from a diversity of backgrounds. It will appeal to historians, philosophers, as well as logicians and computer scientists who want to engage with topics relevant to the history and philosophy of programming and more specifically that of operating systems. (shrink)

This paper proposes an extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system. Chaitin's Ω is defined as the probability that the universal self-delimiting Turing machine U halts, and plays a central role in the development of algorithmic information theory. In the theory, there are two equivalent ways to define the program-size complexity H of a given finite binary string s. In the standard way, H is defined as the length of the shortest (...) input string for U to output s. In the other way, the so-called universal probability m is introduced first, and then H is defined as –log2m without reference to the concept of program-size.Mathematically, the statistics of outcomes in a quantum measurement are described by a positive operator-valued measure in the most general setting. Based on the theory of computability structures on a Banach space developed by Pour-El and Richards, we extend the universal probability to an analogue of POVM in an infinite dimensional quantum system, called a universal semi-POVM. We also give another characterization of Chaitin's Ω numbers by universal probabilities. Then, based on this characterization, we propose to define an extension of Ω as a sum of the POVM elements of a universal semi-POVM. The validity of this definition is discussed.In what follows, we introduce an operator version equation image of H in a Hilbert space of infinite dimension using a universal semi-POVM, and study its properties. (shrink)

Each of our theories of mental representation provides some insight into how the mind works. However, these insights often seem incompatible, as the debates between symbolic, dynamical, emergentist, sub-symbolic, and grounded approaches to cognition attest. Mental representations—whatever they are—must share many features with each of our theories of representation, and yet there are few hypotheses about how a synthesis could be possible. Here, I develop a theory of the underpinnings of symbolic cognition that shows how sub-symbolic dynamics may give rise (...) to higher-level cognitive representations of structures, systems of knowledge, and algorithmic processes. This theory implements a version of conceptual role semantics by positing an internal universal representation language in which learners may create mental models to capture dynamics they observe in the world. The theory formalizes one account of how truly novel conceptual content may arise, allowing us to explain how even elementary logical and computational operations may be learned from a more primitive basis. I provide an implementation that learns to represent a variety of structures, including logic, number, kinship trees, regular languages, context-free languages, domains of theories like magnetism, dominance hierarchies, list structures, quantification, and computational primitives like repetition, reversal, and recursion. This account is based on simple discrete dynamical processes that could be implemented in a variety of different physical or biological systems. In particular, I describe how the required dynamics can be directly implemented in a connectionist framework. The resulting theory provides an “assembly language” for cognition, where high-level theories of symbolic computation can be implemented in simple dynamics that themselves could be encoded in biologically plausible systems. (shrink)

Computation is interpretable symbol manipulation. Symbols are objects that are manipulated on the basis of rules operating only on theirshapes, which are arbitrary in relation to what they can be interpreted as meaning. Even if one accepts the Church/Turing Thesis that computation is unique, universal and very near omnipotent, not everything is a computer, because not everything can be given a systematic interpretation; and certainly everything can''t be givenevery systematic interpretation. But even after computers and computation have been (...) successfully distinguished from other kinds of things, mental states will not just be the implementations of the right symbol systems, because of the symbol grounding problem: The interpretation of a symbol system is not intrinsic to the system; it is projected onto it by the interpreter. This is not true of our thoughts. We must accordingly be more than just computers. My guess is that the meanings of our symbols are grounded in the substrate of our robotic capacity to interact with that real world of objects, events and states of affairs that our symbols are systematically interpretable as being about. (shrink)

IntroductionChildren with severe physical disabilities are denied their fundamental right to move, restricting their development, independence, and participation in life. Brain-computer interfaces (BCIs) could enable children with complex physical needs to access power mobility (PM) devices, which could help them move safely and independently. BCIs have been studied for PM control for adults but remain unexamined in children. In this study, we explored the feasibility of BCI-enabled PM control for children with severe physical disabilities, assessing BCI performance, standard PM skills (...) and tolerability of BCI.Materials and methodsPatient-oriented pilot trial. Eight children with quadriplegic cerebral palsy attended two sessions where they used a simple, commercial-grade BCI system to activate a PM trainer device. Performance was assessed through controlled activation trials (holding the PM device still or activating it upon verbal and visual cueing), and basic PM skills (driving time, number of activations, stopping) were assessed through distance trials. Setup and calibration times, headset tolerability, workload, and patient/caregiver experience were also evaluated.ResultsAll participants completed the study with favorable tolerability and no serious adverse events or technological challenges. Average control accuracy was 78.3 ± 12.1%, participants were more reliably able to activate (95.7 ± 11.3%) the device than hold still (62.1 ± 23.7%). Positive trends were observed between performance and prior BCI experience and age. Participants were able to drive the PM device continuously an average of 1.5 meters for 3.0 s. They were able to stop at a target 53.1 ± 23.3% of the time, with significant variability. Participants tolerated the headset well, experienced mild-to-moderate workload and setup/calibration times were found to be practical. Participants were proud of their performance and both participants and families were eager to participate in future power mobility sessions.DiscussionBCI-enabled PM access appears feasible in disabled children based on evaluations of performance, tolerability, workload, and setup/calibration. Performance was comparable to existing pediatric BCI literature and surpasses established cut-off thresholds (70%) of “effective” BCI use. Participants exhibited PM skills that would categorize them as “emerging operational learners.” Continued exploration of BCI-enabled PM for children with severe physical disabilities is justified. (shrink)

We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal logic.

With the rapid development of the Internet information age, social networks, mobile Internet, and e-commerce have expanded the scope of Internet applications. The “big data” era is a challenge and chance for companies and has a great impact on social economy, politics, culture, and people’s lives. An accurate marketing system is developed based on J2EE, and the architecture is selected from the user layer, business logic layer, and data layer and the B/S3 layer application, including three layers of crip-dm and (...) semma. And, other process methods are used. Data-mining-based marketing system information solutions consist of several parts, such as requirement analysis, design, implementation, and testing. This paper introduces data mining technology to the marketing business based on the practical use and design IT solutions for precision marketing, attribute selection tools, attribute analysis tools, modeling prediction tools, and others. This paper introduces a precision marketing system based on data mining technology. The system passes the actual test and the deployment and the operation of this system are confirmed. The system, which can improve marketing activity, is tested, and the development and operation of this system markedly increase the company’s earnings. (shrink)

Currently, there is widespread skepticism that higher cognitive processes, given their apparent flexibility and globality, could be carried out by specialized computational devices, or modules. This skepticism is largely due to Fodor’s influential definition of modularity. From the rather flexible catalogue of possible modular features that Fodor originally proposed has emerged a widely held notion of modules as rigid, informationally encapsulated devices that accept highly local inputs and whose opera- tions are insensitive to context. It is a mistake, however, to (...) equate such features with computational devices in general and therefore to assume, as Fodor does, that higher cognitive processes must be non-computational. Of the many possible non-Fodorean architectures, one is explored here that offers possible solutions to computational problems faced by conventional modular systems: an ‘enzymatic’ architecture. Enzymes are computational devices that use lock-and-key template matching to iden- tify relevant information (substrates), which is then operated upon and returned to a common pool for possible processing by other devices. Highly specialized enzymes can operate together in a common pool of information that is not pre-sorted by information type. Moreover, enzymes can use molecular ‘tags’ to regulate the operations of other devices and to change how particular substrates are construed and operated upon, allowing for highly interactive, context-specific processing. This model shows how specialized, modular processing can occur in an open system, and suggests that skepti- cism about modularity may largely be due to failure to consider alternatives to the standard model. (shrink)

Nowadays, it has become almost a matter of course to say that the human mind is like a computer. Folks in all walks of life talk of ‘programming’ themselves, ‘multitasking’, running different ‘operating systems’, and sometimes of ‘crashing’ and being ‘rebooted’. Few who have used computers have not been touched by the appeal of the..

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)

Young children with limited knowledge of formal mathematics can intuitively perform basic arithmetic‐like operations over nonsymbolic, approximate representations of quantity. However, the algorithmic rules that guide such nonsymbolic operations are not entirely clear. We asked whether nonsymbolic arithmetic operations have a function‐like structure, like symbolic arithmetic. Children (n = 74 4‐ to ‐8‐year‐olds in Experiment 1; n = 52 7‐ to 8‐year‐olds in Experiment 2) first solved two nonsymbolic arithmetic problems. We then showed children two unequal sets of objects, and (...) asked children which of the two derived solutions should be added to the smaller of the two sets to make them “about the same.” We hypothesized that, if nonsymbolic arithmetic follows similar function rules to symbolic arithmetic, then children should be able to use the solutions of nonsymbolic computations as inputs into another nonsymbolic problem. Contrary to this hypothesis, we found that children were unable to reliably do so, suggesting that these solutions may not operate as independent representations that can be used inputs into other nonsymbolic computations. These results suggest that nonsymbolic and symbolic arithmetic computations are algorithmically distinct, which may limit the extent to which children can leverage nonsymbolic arithmetic intuitions to acquire formal mathematics knowledge. (shrink)

We characterize abstraction in computer science by first comparing the fundamental nature of computer science with that of its cousin mathematics. We consider their primary products, use of formalism, and abstraction objectives, and find that the two disciplines are sharply distinguished. Mathematics, being primarily concerned with developing inference structures, has information neglect as its abstraction objective. Computer science, being primarily concerned with developing interaction patterns, has information hiding as its abstraction objective. We show that abstraction through information hiding is a (...) primary factor in computer science progress and success through an examination of the ubiquitous role of information hiding in programming languages, operating systems, network architecture, and design patterns. (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)

Purpose The purpose of this paper is to explore the ethical issues surrounding information systems practice with a view to encouraging greater involvement in this aspect of IS research. Information integrity relies upon the development and operation of computer-based information systems. Those who undertake the planning, development and operation of these information systems have obligations to assure information integrity and overall to contribute to the public good. This ethical dimension of information systems has attracted mixed attention (...) in the IS academic discipline. Design/methodology/approach The authors are a multidisciplinary team providing a rich, diverse experience which includes professional and information ethics, management information systems, software engineering, data repositories and information systems development. Each author has used this experience to review the IS ethics landscape, which provides four complimentary perspectives. These are synthesised to tease out trends and future pointers. Findings It is confirmed that there is a serious lack of research being undertaken relating to the ethical dimension of the Information Systems field. There is limited crossover between the well-established multidisciplinary community of Computer Ethics research and the traditional Information Systems research community. Originality/value An outline framework is offered which could provide an opportunity for rich and valuable dialogue across the two communities. This is proposed as the starting point for a proactive research and practice action plan for information systems ethics. (shrink)

Minimizing the costs that others impose upon oneself and upon those in whom one has a fitness stake, such as kin and allies, is a key adaptive problem for many organisms. Our ancestors regularly faced such adaptive problems (including homicide, bodily harm, theft, mate poaching, cuckoldry, reputational damage, sexual aggression, and the infliction of these costs on one's offspring, mates, coalition partners, or friends). One solution to this problem is to impose retaliatory costs on an aggressor so that the aggressor (...) and other observers will lower their estimates of the net benefits to be gained from exploiting the retaliator in the future. We posit that humans have an evolved cognitive system that implements this strategy – deterrence – which we conceptualize as a revenge system. The revenge system produces a second adaptive problem: losing downstream gains from the individual on whom retaliatory costs have been imposed. We posit, consequently, a subsidiary computational system designed to restore particular relationships after cost-imposing interactions by inhibiting revenge and motivating behaviors that signal benevolence for the harmdoer. The operation of these systems depends on estimating the risk of future exploitation by the harmdoer and the expected future value of the relationship with the harmdoer. We review empirical evidence regarding the operation of these systems, discuss the causes of cultural and individual differences in their outputs, and sketch their computational architecture. (shrink)

We study vertex operators in 4D conformal field theory derived from quantized gravity, whose dynamics is governed by the Wess-Zumino action by Riegert and the Weyl action. Conformal symmetry is equal to diffeomorphism symmetry in the ultraviolet limit, which mixes positive-metric and negative-metric modes of the gravitational field and thus these modes cannot be treated separately in physical operators. In this paper, we construct gravitational vertex operators such as the Ricci scalar, defined as space-time volume integrals of them are invariant (...) under conformal transformations. Short distance singularities of these operator products are computed and it is shown that their coefficients have physically correct signs. Furthermore, we show that conformal algebra holds even in the system perturbed by the cosmological constant vertex operator as in the case of the Liouville theory shown by Curtright and Thorn. (shrink)

``Neural computing'' is a research field based on perceiving the human brain as an information system. This system reads its input continuously via the different senses, encodes data into various biophysical variables such as membrane potentials or neural firing rates, stores information using different kinds of memories (e.g., short-term memory, long-term memory, associative memory), performs some operations called ``computation'', and outputs onto various channels, including motor control commands, decisions, thoughts, and feelings. We show a natural model of neural computing that (...) gives rise to hyper-computation. Rigorous mathematical analysis is applied, explicating our model's exact computational power and how it changes with the change of parameters. Our analog neural network allows for supra-Turing power while keeping track of computational constraints, and thus embeds a possible answer to the superiority of the biological intelligence within the framework of classical computer science. We further propose it as standard in the field of analog computation, functioning in a role similar to that of the universal Turing machine in digital computation. In particular an analog of the Church-Turing thesis of digital computation is stated where the neural network takes place of the Turing machine. (shrink)

In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a (...) new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity. (shrink)

One of Noam Chomsky's earliest contributions is the idea that a theory of the unbounded construction of hierarchical structures should incorporate a computational system that generates the structures. This chapter focuses on the structure building system, what is sometimes called the computational system, as a source of explanation. In some sense it is the fundamental source of explanation in generative grammar, as it accounts for the central question of the unbounded hierarchical nature of the syntax of human language. The architecture (...) of the computational system of early generative grammar involves a device that carries out elementary operations following a procedure that maps strings of symbols to strings of symbols in two passes (a phrase structure sub‐procedure and a transformational sub‐procedure). (shrink)

Currently, there is widespread skepticism that higher cognitive processes, given their apparent flexibility and globality, could be carried out by specialized computational devices, or modules. This skepticism is largely due to Fodor's influential definition of modularity. From the rather flexible catalogue of possible modular features that Fodor originally proposed has emerged a widely held notion of modules as rigid, informationally encapsulated devices that accept highly local inputs and whose operations are insensitive to context. It is a mistake, however, to equate (...) such features with computational devices in general and therefore to assume, as Fodor does, that higher cognitive processes must be non‐computational. Of the many possible non‐Fodorean architectures, one is explored here that offers possible solutions to computational problems faced by conventional modular systems: an ‘enzymatic’ architecture. Enzymes are computational devices that use lock‐and‐key template matching to identify relevant information (substrates), which is then operated upon and returned to a common pool for possible processing by other devices. Highly specialized enzymes can operate together in a common pool of information that is not pre‐sorted by information type. Moreover, enzymes can use molecular ‘tags’ to regulate the operations of other devices and to change how particular substrates are construed and operated upon, allowing for highly interactive, context‐specific processing. This model shows how specialized, modular processing can occur in an open system, and suggests that skepticism about modularity may largely be due to failure to consider alternatives to the standard model. (shrink)

Two widely accepted assumptions within cognitive science are that (1) the goal is to understand the mechanisms responsible for cognitive performances and (2) computational modeling is a major tool for understanding these mechanisms. The particular approaches to computational modeling adopted in cognitive science, moreover, have significantly affected the way in which cognitive mechanisms are understood. Unable to employ some of the more common methods for conducting research on mechanisms, cognitive scientists’ guiding ideas about mechanism have developed in conjunction with their (...) styles of modeling. In particular, mental operations often are conceptualized as comparable to the processes employed in classical symbolic AI or neural network models. These models, in turn, have been interpreted by some as themselves intelligent systems since they employ the same type of operations as does the mind. For this paper, what is significant about these approaches to modeling is that they are constructed specifically to account for behavior and are evaluated by how well they do so—not by independent evidence that they describe actual operations in mental mechanisms. (shrink)

Abstract: Background: In spite of the fact that computers continue to improve in speed and functions operation, they remain complex to use. Problems frequently happen, and it is hard to resolve or find solutions for them. This paper outlines the significance and feasibility of building a desktop PC problems diagnosis system. The system gathers problem symptoms from users’ desktops, rather than the user describes his/her problems to primary search engines. It automatically searches global databases of problem symptoms and solutions, (...) and also allows ordinary users to contribute exact problem reports in a structured manner. Objectives: The main goal of this Knowledge Based System is to get the suitable problem desktop PC symptoms and the correct way to solve the errors. Methods: In this paper the design of the proposed Knowledge Based System which was produced to help users of desktop PC in knowing many of the problems and error such as : Power supply problems, CPU errors, RAM dumping error, hard disk errors and bad sectors and suddenly restarting PC. The proposed Knowledge Based System presents an overview about desktop PC hardware errors are given, the cause of fault are outlined and the solution to the problems whenever possible is given out. CLIPS Knowledge Based System language was used for designing and implementing the proposed expert system. Results: The proposed PC desktop troubleshooting Knowledge Based System was evaluated by IT students and they were satisfied with its performance. (shrink)

While the notion of the mind as information-processor--a kind of computational system--is widely accepted, many scientists and philosophers have assumed that this account of cognition shows that the mind's operations are characterizable independent of their relationship to the external world. Existential Cognition challenges the internalist view of mind, arguing that intelligence, thought, and action cannot be understood in isolation, but only in interaction with the outside world. Arguing that the mind is essentially embedded in the external world, Ron McClamrock provides (...) a schema that allows cognitive scientists to address such long-standing problems in artificial intelligence as the "frame" problem and the issue of "bounded" rationality. Extending this schema to cover progress in other studies of behavior, including language, vision, and action, McClamrock reinterprets the importance of the organism/environment distinction. McClamrock also considers the broader philosophical question of the place of mind in the world, particularly with regard to questions of intentionality, subjectivity, and phenomenology. With implications for philosophy, cognitive and computer science, AI, and psychology, this book synthesizes state-of-the-art work in philosophy and cognitive science on how the mind interacts with the world to produce thoughts, ideas, and actions. (shrink)

Quantum mechanical measurements on a physical system are represented by observables - Hermitian operators on the state space of the observed system. It is an important question whether all observables may be realized, in principle, as measurements on a physical system. Dirac’s influential text ( [1], page 37) makes the following assertion on the question: The question now presents itself – Can every observable be measured? The answer theoretically is yes. In practice it may be very awkward, or perhaps even (...) beyond the ingenuity of the experimenter, to devise an apparatus which could measure some particular observable, but the theory always allows one to imagine that the measurement can be made. This Letter re-examines the question of whether it is possible, even in principle, to measure every quantum mechanical observable. Unexpectedly, ideas from com-. (shrink)

Many of our cognitive capacities are shaped by enculturation. Enculturation is the acquisition of cognitive practices such as symbol-based mathematical practices, reading, and writing during ontogeny. Enculturation is associated with significant changes to the organization and connectivity of the brain and to the functional profiles of embodied actions and motor programs. Furthermore, it relies on scaffolded cultural learning in the cognitive niche. The purpose of this paper is to explore the components of symbol-based mathematical practices. Phylogenetically, these practices are the (...) result of concerted organism-niche interactions that have led from approximate number estimations to the emergence of discrete, symbol-based mathematical operations. Ontogenetically, symbol-based mathematical practices are associated with plastic changes to neural circuitry, action schemata, and motor programs. It will be suggested that these practices rely on previously acquired capacities such as subitizing and counting. With these considerations in place, I will argue that computations, understood in the sense of Turing (1936), are a specific kind of symbol-based mathematical practices that can be realized by human organisms, machines, or by hybrid organism-machine systems. In sum, this paper suggests a new way to think about mathematical cognition and computation. (shrink)

Although Paul Churchland and Jerry Fodor both subscribe to the so-called theory-theory– the theory that folk psychology (FP) is an empirical theory of behavior – they disagree strongly about FP’s fate. Churchland contends that FP is a fundamentally flawed view analogous to folk biology, and he argues that recent advances in computational neuroscience and connectionist AI point toward development of a scientifically respectable replacement theory that will give rise to a new common-sense psychology. Fodor, however, wagers that FP will be (...) largely preserved and vindicated by scientific investigations of behavior. Recent findings by developmental psychologists, I argue, will push both Churchlandians and Fodorians toward the pessimistic view that FP is a misguided theory that will never be displaced, because it is, so to speak, built into our cognitive systems. I explore the possibility of preserving optimism by rejecting the theory-theory and adopting the simulation theory, a competing view developed by Robert Gordon, Alvin Goldman, and Jane Heal. According to simulationists, common-sense interpretation of behavior is accomplished by means of pretense-like operations that deploy the cognitive system’s own reasoning capabilities in a disengaged manner. Since on this view no theory-like set of principles would be needed, the simulation theory seems to enjoy a simplicity advantage over the theory-theory. Steven Stich and Shawn Nichols, however, contend that as the cognitive system would require special mechanisms for disengaged operation, the simplicity question cannot be resolved until suitable computational models are developed. I describe a set of models I have constructed to meet this need, and I discuss the contribution such models can make to determining FP’s fate. (shrink)

The goal of this paper is to define and analyze systems which exhibit brittle behavior. This behavior is characterized by a sudden and steep decline in performance as the system approaches the limits of tolerance. This can be due to input parameters which exceed a specified input, or environmental conditions which exceed specified operating boundaries. An analogy is made between brittle commmunication systems in particular and materials science.

In lieu of an abstract, here is a brief excerpt of the content:Operating in a Contemporary Safety NetJason D. KeuneIt is summer, and I have just started my fourth year of general surgery residency, having just returned from two years in the lab. My “lab years” were spent as a Scholar–in–Residence of the American College of Surgeons. The scholarship that I engaged in included obtaining an MBA and a Graduate Certificate in Professional Ethics. The ethics component was self–designed with (...) help from an advisor, and was made up of graduate courses in political theory, healthcare financing law and bioethics. To say that I was reflective as I returned to the clinical rotations of the fourth year of residency would be understated.During this two–year period, I did not operate. I did do some clinical work during this time, but there wasn’t anyone in town willing to hire a partially–trained surgeon to do anything operative. I ended my third year of residency very happy with my technical skills, and was not sure just how these skills would survive a two–year hiatus. The challenge, as I thought of it then, would be to return to clinical rotations with this insecurity in mind and try to gain insight into just how rusty my skills were in a short period of time, and rectify them. I was in for a surprise.I felt a chill of trepidation when I discovered that the rotation that had been selected for me to return to was one in which I would be assigned to operate on and care for a low–income population of uninsured or underinsured patients with surgical problems—with minimal attending supervision. The patients were referred from the Federally Qualified Health Centers in town. The rotation had arisen from altruistic roots. The surgical service, provided at a large, academic urban hospital, was established when the city’s last remaining public hospital closed its doors for surgical patients. The service was an upright attempt to provide surgical continuity for this population. As I started the rotation and performed my first surgeries in two years with very minimal supervision, I realized that I would be participatory in what sums to a thoroughly unjust healthcare system. I would be caught in a swirl of humanitarian justice celebrated and a focus on a justice that seemed to fall short of a mark.The indigent hospital itself managed the clinic with a full complement of staff befitting a contemporary surgical clinic, albeit with a rather rudimentary computer system. The recordkeeping mechanism in our surgical office, however, was done without administrative assistance. We occupied a small room amongst the academic surgical offices at our home institution. The chief resident sat at a large [End Page 12] desk, the intern at a smaller desk, and the medical student had a chair and a laptop. The recordkeeping mechanism tracking who needed surgery, who had had surgery, and who needed follow–up on pathology was maintained by all members of the team. It involved one labyrinthine Excel spreadsheet, with multiple tabs, and a complex color–coordinated scheme of organization. The team would scan the entire thing on a daily basis to make sure nothing would be missed.When it came time to schedule a patient for the operating room, it was my responsibility as a chief resident to get an attending to “cover the case”, which amounted to finding an attending who agreed, at the bare minimum, to be present for the “critical portion” of the case. If the case was complex or very difficult, an attending surgeon would have to be sought who would scrub in and help perform the procedure. Not every attending would cover a charity case—the reasons why were not forthcoming. One surgeon would scrub every case he was asked to cover, stating that he felt every patient should have the same chance at the best treatment. Another would come to the room, but sit along the wall and review manuscripts as we operated, there to grant reassurance, and answer questions, but not, presumably, to direct the overall decision–making. All patients with breast cancer were seen, and operated on by one very dedicated breast surgeon with a humanitarian bent.I... (shrink)

Classical computational modellers of mind urge that the mind is something like a von Neumann computer operating over a system of symbols constituting a language of thought. Such an architecture, they argue, presents us with the best explanation of the compositionality, systematicity and productivity of thought. The language of thought hypothesis is supported by additional independent arguments made popular by Jerry Fodor. Paul Smolensky has developed a connectionist architecture he claims adequately explains compositionality, systematicity and productivity without positing any (...) language of thought, and without positing any operations over a set of symbols. This architecture encodes the information represented in linguistic trees without explicitly representing those trees or their constituents, and indeed without employing any representational vehicles with constituent structure. In a recent article, Fodor (1997; Connectionism and systematicity, Cognition , 62, 109-119) argues that Smolensky's proposal does not work. I defend Smolensky against Fodor's attack, and use this interchange as a vehicle for exploring and criticising the “Language of Thought” hypothesis more generally and the arguments Fodor adduces on its behalf. (shrink)

According to structuralism in philosophy of mathematics, arithmetic is about a single structure. First-order theories are satisfied by models that do not instantiate this structure. Proponents of structuralism have put forward various accounts of how we succeed in fixing one single structure as the intended interpretation of our arithmetical language. We shall look at a proposal that involves Tennenbaum's theorem, which says that any model with addition and multiplication as recursive operations is isomorphic to the standard model of arithmetic. On (...) this account, the intended models of arithmetic are the notation systems with recursive operations on them satisfying the Peano axioms. [A]m Anfang […] ist das Zeichen. (shrink)

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found wanting. In this paper we investigate congruential non-classical negations that live inside very natural systems of normal modal logics over complete distributive lattices; these logics are further enriched by adjustment connectives that may (...) be used for handling reasoning under uncertainty caused by inconsistency or undeterminedness. Using such straightforward semantics, we study the classes of frames characterized by seriality, reflexivity, functionality, symmetry, transitivity, and some combinations thereof, and discuss what they reveal about sub-classical properties of negation. To the logics thereby characterized we apply a general mechanism that allows one to endow them with analytic ordinary sequent systems, most of which are even cut-free. We also investigate the exact circumstances that allow for classical negation to be explicitly defined inside our logics. (shrink)

This paper discusses the possibility of creating a digital platform based on Mojo v3 for monitoring the operation of a dual-circuit solar collector. In the proposed system, measurements are made from 6 digital sensors, 16 wires are used. Using Dallas sensors and the appropriate software, you can monitor the temperature level and the amount of heat. The use of 6 digital sensors significantly increases the efficiency of control over the system and increases the speed of data processing. The possibilities of (...) configuring sensors for the platform Mojo v3, as well as the control circuit of the solar collector are considered. (shrink)

Brain Computer Interface (BCI) technology offers potential for human augmentation in areas ranging from communication to home automation, leisure and gaming. This paper addresses ethical challenges associated with the wider scale deployment of BCI as an assistive technology by documenting issues associated with the development of non-invasive BCI technology. Laboratory testing is normally carried out with volunteers but further testing with subjects, who may be in vulnerable groups is often needed to improve system operation. BCI development is technically complex, sometimes (...) requiring lengthy recording sessions to achieve the necessary personalisation of the paradigms, and this can present ethical challenges that vary depending on the subject group. The paper contributes to the on-going ethical discussion surrounding the deployment BCI outside the specialist laboratory and suggests some tentative guidelines for BCI research teams, appropriate to those deploying the technology, derived from experience on a multisite project. Any tension between deployment and technical progress must be managed by a formal process within a multidisciplinary consortium. (shrink)