Visions and imaginaries have been longstanding research topics in Science and Technology Studies. Visions of sociotechnical change often ascribe responsibility for achieving the desired change to specific actors. However, there is little research on how visions create, change, and preserve responsibilities in the present. Drawing on Vision Assessment, we present a case-study on visions of neuromorphic computing in NeuroSys, a research and innovation cluster located in the Aachen region in Germany, which develops brain-inspired computing technology, also known (...) as neuromorphic computing. Based on interviews, participant observation, and document analysis, we identify a core vision, which imagines the region as a prominent center of neuromorphic computing, and three satellite visions, focusing on, respectively, entrepreneurship, science, and society. We analyze all visions through the lens of “responsibility boundary-work” operating in the dimensions of time, space, and actor constellation. This concept captures the selective conferral and deferral of responsibilities through visions, highlighting how normative boundaries are drawn in local practices. We further shed light on the larger institutional conditions shaping responsibility boundary-work by attending to the “politics of visions.” Power struggles are enacted through the ways in which visions confer and defer responsibilities. Tensions between these practices reflect conflicts over desirable social orders and power distributions within them, revealing the socio-political nature of visions. We discuss the implications of these findings for governance approaches that pursue responsible research and technology development, and we conclude that responsibility boundary-work may limit the potential of governance to conceive of and work toward responsible futures. (shrink)

This article discusses recent advancements in neurotechnologies and how they seem to support the Extended Mind Thesis (EMT), while also raising concerns about the mental integrity and privacy of individuals. In Sect. 1 we review recent research carried out at the frontiers of Brain Machine Interfaces (BMIs) and neuromorphic computing. Taking inspiration (Sect. 2) from research in these fields we present -with the help of some imagination- a futurist scenario of complete human-computer integration. We discuss a set of (...) practical benefits and risks associated with the implementation of such a scenario, which -despite being fictional at the time of writing- is likely to be realized soon. We frame our discussion (Sect. 3) in the context of research conducted in the cognitive sciences on the extended mind thesis (EMT). We reflect on the epistemic and ontic aspects underlying such a scenario and argue that EMT finds supports in it. We further problematize (Sect. 4) around the significance of this envisaged scenario for research on neuro-rights. We therefore also discuss a series of ethical challenges related to their potential infringement. We conclude the paper (Sect. 5) by showing that the development of specific neurotechnologies can make the extension of the mind an increasingly pervasive and transformative phenomenon, while raising important concerns about the potential consequences for certain characteristics of individuals that may be crucial to preserve through the introduction of neurorights. (shrink)

Substrate independence and mind-body functionalism claim that thinking does not depend on any particular kind of physical implementation. But real-world information processing depends on energy, and energy depends on material substrates. Biological evidence for these claims comes from ecology and neuroscience, while computational evidence comes from neuromorphic computing and deep learning. Attention to energy requirements undermines the use of substrate independence to support claims about the feasibility of artificial intelligence, the moral standing of robots, the possibility that we (...) may be living in a computer simulation, the plausibility of transferring minds into computers, and the autonomy of psychology from neuroscience. (shrink)

Despite the impressive amount of financial resources invested in carrying out large-scale brain simulations, it is controversial what the payoffs are of pursuing this project. The present paper argues that in some cases, from designing, building, and running a large-scale neural simulation, scientists acquire useful knowledge about the computational performance of the simulating system, rather than about the neurobiological system represented in the simulation. What this means, why it is not a trivial lesson, and how it advances the literature on (...) the epistemology of computer simulation are the three preoccupations addressed by the paper. (shrink)

Unsupervised statistical learning is the standard setting for the development of the only advanced visual system that is both highly sophisticated and versatile, and extensively studied: that of monkeys and humans. In this extended abstract, we invoke philosophical observations, computational arguments, behavioral data and neurobiological findings to explain why computer vision researchers should care about (1) unsupervised learning, (2) statistical inference, and (3) the visual brain. We then outline a neuromorphic approach to structural primitive learning motivated by these considerations, (...) survey a range of neurobiological findings and behavioral data consistent with it, and conclude by mentioning some of the more challenging directions for future research. (shrink)

The “Human Brain Project” (HBP) is a large-scale European neuroscience and information communication technology (ICT) project that has been a matter of heated controversy since its inception. With its aim to simulate the entire human brain with the help of supercomputing technologies, the HBP plans to fundamentally change neuroscientific research practice, medical diagnosis, and eventually the use of computers itself. Its controversial nature and its potential impacts render the HBP a subject of crucial importance for critical studies of science and (...) society. In this paper, we provide a critical exploratory analysis of the potential mid- to long-term impacts the HBP and its ICT infrastructure could be expected to have, provided its agenda will indeed be implemented and executed to a substantive degree. We analyse how the HBP aspires to change current neuroscientific practice, what impact its novel infrastructures could have on research culture, medical practice and the use of ICT, and how, given a certain degree of successful execution of the project’s aims, potential clinical and methodological applications could even transform society beyond scientific practice. Furthermore, we sketch the possibility that research such as that projected by the HBP may eventually transform our everyday world, even beyond the scope of the HBP’s explicit agenda, and beyond the isolated ‘application’ of some novel technological device. Finally, we point towards trajectories for further philosophical, historical and sociological research on the HBP that our exploratory analysis might help to inspire. Our analysis will yield important insights regardless of the actual success of the HBP. What we drive at, for the most part, is the broader dynamics of scientific and technological development of which the HBP agenda is merely one particularly striking exemplification. (shrink)

Technoscientific ambitions for perfecting human-like machines, by advancing state-of-the-art neuromorphic architectures and cognitive computing, may end in ironic regret without pondering the humanness of fallible artificial non-normative personalities. Self-organizing artificial personalities individualize machine performance and identity through fuzzy conscientiousness, emotionality, extraversion/introversion, and other traits, rendering insights into technology-assisted human evolution, robot ethology/pedagogy, and best practices against unwanted autonomous machine behavior.

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)

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)

Theory of Mind (ToM), the cognitive capacity to attribute internal mental states to oneself and others, is a crucial component of social skills. Its formal study has become important, witness recent research on reasoning and information update by intelligent agents, and some proposals for its formal modelling have put forward settings based on Epistemic Logic (EL). Still, due to intrinsic idealisations, it is questionable whether EL can be used to model the high-order cognition of ‘real’ agents. This manuscript proposes a (...) framework that takes visibility, memory, perspective and communication as the main factors underpinning mental attributions. This is more in-line with findings in cognitive science and allows us to model well-known False-Belief Tasks that are typically used in testing people's ToM. We discuss some of the framework's technical features, arguing why it does justice to empirical observations. (shrink)

The problem of intentional identity, as originally offered by Peter Geach, says that there can be an anaphoric link between an indefinite term and a pronoun across a sentential boundary and across propositional attitude contexts, where the actual existence of an individual for the indefinite term is not presupposed. In this paper, a semantic resolution to this elusive puzzle is suggested, based on a new quantified intensional logic and game-theoretic semantics (GTS) of imperfect information. This constellation leads to an expressive (...) intensional language with a property of informational independence, argued to produce a purely semantic explication to intentional identity statements. One consequence is that various extra-logical and pragmatic factors become of secondary concern; it is possible to solve the puzzle by logico-semantic methods, albeit somewhat radically renewed ones. (shrink)

PurposeThe purpose of this paper is to explain the sense of choice in our contemporary world.Design/methodology/approachTaking cue from the research of the Institute of Neuroinformatics of Swiss Federal Institute of Technology, and University of Zürich, this paper is meant to highlight that the contemporary individual is gradually abandoning his own freedom of choice: the principle of moral responsibility, and – consequently – sign of humanity.FindingsIf today the smartphone is the most used tool, in the future we will soon benefit from (...) a chip under skin which could delegate our choices. It is a piece of technology that is not only inspired by biology to create robots, but could also change our life.Originality/valueFrom the massive use of the cell phone to the robots which apparently ‘‘feel’’ and show emotions like humans do. From the wearable exoskeleton to the prototype reproducing the artificial sense of touch, technological progress explodes to the extent of embodying itself in our nakedness. (shrink)

First-ever comprehensive introduction to the major new subject of quantum computing and quantum information.

Computable analysis provides ways of representing points in a topological space, and therefore of defining a notion of computable points of the space. In this article, we investigate when two topologies on the same space induce different sets of computable points. We first study a purely topological version of the problem, which is to understand when two topologies are not $\sigma $ -homeomorphic. We obtain a characterization leading to an effective version, and we prove that two topologies satisfying this condition (...) induce different sets of computable points. Along the way, we propose an effective version of the Baire category theorem which captures the construction technique, and enables one to build points satisfying properties that are co-meager with respect to a topology, and are computable with respect to another topology. Finally, we generalize the result to three topologies and give an application to prove that certain sets do not have computable type, which means that they have a homeomorphic copy that is semicomputable but not computable. (shrink)

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a (...) simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual. (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)

Computational methods such as computer simulations, Monte Carlo methods, and agent-based modeling have become the dominant techniques in many areas of science. Extending Ourselves contains the first systematic philosophical account of these new methods, and how they require a different approach to scientific method. Paul Humphreys draws a parallel between the ways in which such computational methods have enhanced our abilities to mathematically model the world, and the more familiar ways in which scientific instruments have expanded our access to the (...) empirical world. This expansion forms the basis for a new kind of empiricism, better suited to the needs of science than the older anthropocentric forms of empiricism. Human abilities are no longer the ultimate standard of epistemological correctness.Humphreys also includes arguments for the primacy of properties rather than objects, the need to consider technological constraints when appraising scientific methods, and a detailed account of how the path from computational template to scientific application is constructed. This last feature allows us to hold a form of selective realism in which anti-realist arguments based on formal reconstructions of theories can be avoided. One important consequence of the rise of computational methods is that the traditional organization of the sciences is being replaced by an organization founded on computational templates.Extending Ourselves will be of interest to philosophers of science, epistemologists, and to anyone interested in the role played by computers in modern science. (shrink)

Since the cognitive revolution, it has become commonplace that cognition involves both computation and information processing. Is this one claim or two? Is computation the same as information processing? The two terms are often used interchangeably, but this usage masks important differences. In this paper, we distinguish information processing from computation and examine some of their mutual relations, shedding light on the role each can play in a theory of cognition. We recommend that theorists of cognition be explicit and careful (...) in choosing notions of computation and information and connecting them together.Keywords: Computation; Information processing; Computationalism; Computational theory of mind; Cognitivism. (shrink)

Gualtiero Piccinini articulates and defends a mechanistic account of concrete, or physical, computation. A physical system is a computing system just in case it is a mechanism one of whose functions is to manipulate vehicles based solely on differences between different portions of the vehicles according to a rule defined over the vehicles. Physical Computation discusses previous accounts of computation and argues that the mechanistic account is better. Many kinds of computation are explicated, such as digital vs. analog, serial (...) vs. parallel, neural network computation, program-controlled computation, and more. Piccinini argues that computation does not entail representation or information processing although information processing entails computation. Pancomputationalism, according to which every physical system is computational, is rejected. A modest version of the physical Church-Turing thesis, according to which any function that is physically computable is computable by Turing machines, is defended. (shrink)

Intelligent Tutoring Systems (ITS) has a wide influence on the exchange rate, education, health, training, and educational programs. In this paper we describe an intelligent tutoring system that helps student study computer networks. The current ITS provides intelligent presentation of educational content appropriate for students, such as the degree of knowledge, the desired level of detail, assessment, student level, and familiarity with the subject. Our Intelligent tutoring system was developed using ITSB authoring tool for building ITS. A preliminary evaluation of (...) the ITS was done by a group of students and teachers. The results were acceptable. (shrink)

Computation is central to the foundations of modern cognitive science, but its role is controversial. Questions about computation abound: What is it for a physical system to implement a computation? Is computation sufficient for thought? What is the role of computation in a theory of cognition? What is the relation between different sorts of computational theory, such as connectionism and symbolic computation? In this paper I develop a systematic framework that addresses all of these questions. Justifying the role of computation (...) requires analysis of implementation, the nexus between abstract computations and concrete physical systems. I give such an analysis, based on the idea that a system implements a computation if the causal structure of the system mirrors the formal structure of the computation. This account can be used to justify the central commitments of artificial intelligence and computational cognitive science: the thesis of computational sufficiency, which holds that the right kind of computational structure suffices for the possession of a mind, and the thesis of computational explanation, which holds that computation provides a general framework for the explanation of cognitive processes. The theses are consequences of the facts that (a) computation can specify general patterns of causal organization, and (b) mentality is an organizational invariant, rooted in such patterns. Along the way I answer various challenges to the computationalist position, such as those put forward by Searle. I close by advocating a kind of minimal computationalism, compatible with a very wide variety of empirical approaches to the mind. This allows computation to serve as a true foundation for cognitive science. (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)

In this paper we show that for any set X ⊆ ω there exists a structure [MATHEMATICAL SCRIPT CAPITAL A] that has no presentation computable in X such that [MATHEMATICAL SCRIPT CAPITAL A]2 has a computable presentation. We also show that there exists a structure [MATHEMATICAL SCRIPT CAPITAL A] with infinitely many computable isomorphism types such that [MATHEMATICAL SCRIPT CAPITAL A]2 has exactly one computable isomorphism type.

We study computability of the abstract linear Cauchy problem equation image)where A is a linear operator, possibly unbounded, on a Banach space X. We give necessary and sufficient conditions for A such that the solution operator K: x ↦ u of the problem is computable. For studying computability we use the representation approach to computable analysis developed by Weihrauch and others. This approach is consistent with the model used by Pour-El/Richards.

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)

A brain-computer interface technology that can decode the neural signals associated with attempted but unarticulated speech could offer a future efficient means of communication for people with severe motor impairments. Recent demonstrations have validated this approach. Here we assume that it will be possible in future to decode imagined (i.e., attempted but unarticulated) speech in people with severe motor impairments, and we consider the characteristics that could maximize the social utility of a BCI for communication. As a social interaction, communication (...) involves the needs and goals of both speaker and listener, particularly in contexts that have significant potential consequences. We explore three high-consequence legal situations in which neurally-decoded speech could have implications:Testimony, where decoded speech is used as evidence;Consent and Capacity, where it may be used as a means of agency and participation such as consent to medical treatment; andHarm, where such communications may be networked or may cause harm to others. We then illustrate how design choices might impact the social and legal acceptability of these technologies. (shrink)

We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces (...) constructed. (shrink)

We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π01 class P is a subshift if and only if there exists a computable function F mapping 2ℕ to 2ℕ such that P is the set of itineraries of elements of 2ℕ. Π01 subshifts are constructed in 2ℕ and in 2ℤ which have no computable elements. We also consider the symbolic dynamics of maps on the unit interval.

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

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts (...) and methods originating from randomness enrich computability theory.The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory. (shrink)

We have previously established that [Formula: see text]-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann–Howard fixed point, over [Formula: see text]. In this paper, we show that the base theory can be lowered to [Formula: see text]. We also show that the minimal Bachmann–Howard fixed point of a dilator [Formula: see text] can be represented by a notation system [Formula: see text], which is computable relative to [Formula: see text]. The statement that [Formula: see text] (...) is well founded for any dilator [Formula: see text] will still be equivalent to [Formula: see text]-comprehension. Thus, the latter is split into the computable transformation [Formula: see text] and a statement about the preservation of well-foundedness, over a system of computable mathematics. (shrink)

This book addresses key conceptual issues relating to the modern scientific and engineering use of computer simulations. It analyses a broad set of questions, from the nature of computer simulations to their epistemological power, including the many scientific, social and ethics implications of using computer simulations. The book is written in an easily accessible narrative, one that weaves together philosophical questions and scientific technicalities. It will thus appeal equally to all academic scientists, engineers, and researchers in industry interested in questions (...) related to the general practice of computer simulations. (shrink)

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland (...) begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest. (shrink)

This book is dedicated to a classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal (...) logic to give a full development of Gödel's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics". (shrink)

The ‘received view’ about computation is that all computations must involve representational content. Egan and Piccinini argue against the received view. In this paper, I focus on Egan’s arguments, claiming that they fall short of establishing that computations do not involve representational content. I provide positive arguments explaining why computation has to involve representational content, and how that representational content may be of any type. I also argue that there is no need for computational psychology to be individualistic. Finally, I (...) draw out a number of consequences for computational individuation, proposing necessary conditions on computational identity and necessary and sufficient conditions on computational I/O equivalence of physical systems.Keywords: Computation; Representation; Computational identity; Explanation; Narrow content; Physical computation. (shrink)

The computational view of mind rests on certain intuitions regarding the fundamental similarity between computation and cognition. We examine some of these intuitions and suggest that they derive from the fact that computers and human organisms are both physical systems whose behavior is correctly described as being governed by rules acting on symbolic representations. Some of the implications of this view are discussed. It is suggested that a fundamental hypothesis of this approach is that there is a natural domain of (...) human functioning that can be addressed exclusively in terms of a formal symbolic or algorithmic vocabulary or level of analysis. Much of the paper elaborates various conditions that need to be met if a literal view of mental activity as computation is to serve as the basis for explanatory theories. The coherence of such a view depends on there being a principled distinction between functions whose explanation requires that we posit internal representations and those that we can appropriately describe as merely instantiating causal physical or biological laws. In this paper the distinction is empirically grounded in a methodological criterion called the " cognitive impenetrability condition." Functions are said to be cognitively impenetrable if they cannot be influenced by such purely cognitive factors as goals, beliefs, inferences, tacit knowledge, and so on. Such a criterion makes it possible to empirically separate the fixed capacities of mind from the particular representations and algorithms used on specific occasions. In order for computational theories to avoid being ad hoc, they must deal effectively with the "degrees of freedom" problem by constraining the extent to which they can be arbitrarily adjusted post hoc to fit some particular set of observations. This in turn requires that the fixed architectural function and the algorithms be independently validated. It is argued that the architectural assumptions implicit in many contemporary models run afoul of the cognitive impenetrability condition, since the required fixed functions are demonstrably sensitive to tacit knowledge and goals. The paper concludes with some tactical suggestions for the development of computational cognitive theories. (shrink)

From the philosopher’s perspective, the interest in quantum computation stems primarily from the way that it combines fundamental concepts from two distinct sciences: Physics, in particular Quantum Mechanics, and Computer Science, each long a subject of philosophical speculation and analysis in its own right. Quantum computing combines both of these more traditional areas of inquiry into one wholly new, if not quite independent, science. Over the course of this chapter we will be discussing some of the most important philosophical (...) questions that arise from this merger and philosophical lessons to be learned. (shrink)

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content is (...) extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (shrink)

Unlimited pancomputationalism is the claim that every physical system implements every computational model simultaneously. Some philosophers argue that unlimited pancomputationalism renders implementation ‘trivial’ or ‘vacuous’, unsuitable for serious scientific work. A popular and natural reaction to this argument is to reject unlimited pancomputationalism. However, I argue that given certain assumptions about the nature of computational ascription, unlimited pancomputationalism does not entail that implementation is trivial. These assumptions concern the relativity and context sensitivity of computational ascription. Very roughly: relative to a (...) specific, contextually salient way of regarding a physical system computationally, the claim that that system implements a specific computational model is as non-trivial as one could reasonably want. (shrink)

Provability, Computability and Reflection.

Structured argumentation systems, and their implementation, represent an important research subject in the area of Knowledge Representation and Reasoning. Structured argumentation advances over abstract argumentation frameworks by providing the internal construction of the arguments that are usually defined by a set of (strict and defeasible) rules. By considering the structure of arguments, it becomes possible to analyze reasons for and against a conclusion, and the warrant status of such a claim in the context of a knowledge base represents the main (...) output of a dialectical process. Computing such statuses is a costly process, and any update to the knowledge base could potentially have a huge impact if done naively. In this work, we investigate the case of updates consisting of both additions and removals of pieces of knowledge in the Defeasible Logic Programming (DeLP) framework, first analyzing the complexity of the problem and then identifying conditions under which we can avoid unnecessary computations—central to this is the development of structures (e.g. graphs) to keep track of which results can potentially be affected by a given update. We introduce a technique for the incremental computation of the warrant statuses of conclusions in DeLP knowledge bases that evolve due to the application of (sets of) updates. We present the results of a thorough experimental evaluation showing that our incremental approach yields significantly faster running times in practice, as well as overall fewer recomputations, even in the case of sets of updates performed simultaneously. (shrink)

This paper aims to connect Stiegler’s reflections on theoretical computer science with his practical propositions for the design of digital technologies. Indeed, Stiegler’s theory of exosomatization implies a new conception of artificial intelligence, which is not based on an analogical paradigm (which compares organisms and machines, as in cybernetics, or which compares thought and computing, as in cognitivism) but on an organological paradigm, which studies the co-evolution of living organisms (individuals), artificial organs (tools), and social organizations (institutions). Such a (...) perspective does not compare human capacities to machine performances but studies the way in which the evolution of material and technical supports affects and transforms psychological, cognitive or noetic faculties (intuition, memory, understanding, imagination, sensibility, reason, etc.), as well as the constitution of different kinds of knowledge. This new theoretical paradigm implies a new ‘design’ for digital technologies, which considers their social role and their impact on psychological, cognitive or noetic faculties. (shrink)

This article presents the evolution of philosophical and methodological considerations concerning empiricism in computer/computing science. In this study, we trace the most important current events in the history of reflection on computing. The forerunners of Artificial Intelligence H.A. Simon and A. Newell in their paper Computer Science As Empirical Inquiry started these considerations. Later the concept of empirical computer science was developed by S.S. Shapiro, P. Wegner, A.H. Eden and P.J. Denning. They showed various empirical aspects of (...) class='Hi'>computing. This led to a view of the science of computing - the science of general scope. Some interesting contemporary ways towards a generalized perspective on computations were also shown. (shrink)