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)

Normative positions are sometimes illustrated in diagrams, in particular in didactic contexts. Traditional examples are the Aristotelian polygons of opposition for deontic modalities (squares, triangles, hexagons, etc.), and the Hohfeldian squares for obligative and potestative concepts. Relying on previous work, we show that Hohfeld’s framework can be used as a basis for developing several Aristotelian polygons and more complex diagrams. Then, we illustrate how logical theories of increasing strength can be built based on these diagrams, and how those theories enable (...) us to determine in a computably efficient way whether a set of normative positions can be derived from another set of normative positions. (shrink)

Three variants of Kurt Gödel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of Gödel's argument the two variants contributed by Anderson and Fitting avoid modal collapse. Although they appear quite different on a cursory reading they are in fact closely related. This has been revealed in the computer-supported formal analysis presented in this article. Key to our formal analysis is the utilization of (...) suitably adapted notions of ultrafilters, and a careful distinction between extensions and intensions of positive properties. (shrink)

The central claim of computationalism is generally taken to be that the brain is a computer, and that any computer implementing the appropriate program would ipso facto have a mind. In this paper I argue for the following propositions: (1) The central claim of computationalism is not about computers, a concept too imprecise for a scienti c claim of this sort, but is about physical calculi (instantiated discrete formal systems). (2) In matters of formality, interpretability, and so forth, analog computation (...) and digital computation are not essentially di erent, and so arguments such as Searle's hold or not as well for one as for the other. (3) Whether or not a biological system (such as the brain) is computational is a scienti c matter of fact. (4) A substantive scienti c question for cognitive science is whether cognition is better modeled by discrete representations or by continuous representations. (5) Cognitive science and AI need a theoretical construct that is the continuous analog of a calculus. The discussion of these propositions will illuminate several terminology traps, in which it's all too easy to become ensnared. (shrink)

It has been claimed that (1) computer professionals should be held responsible for an undisclosed list of “undesirable events” associated with their work and (2) most if not all computer disasters can be avoided by truly understanding responsibility. Programmers, software developers, and other computer professionals should be defended against such vague, counterproductive, and impossible ideals because these imply the mandatory satisfaction of social needs and the equation of ethics with a kind of altruism. The concept of social needs is debatable (...) with no one possessing the authority to impose their version of them. Similarly, the notion of “positive responsibility” is difficult to apply, does not effectively change computing practice, and confuses good (i.e., efficient) computer engineering with good (i.e. moral) computer engineering. (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)

Recently, the Dimension Problem for effective Hausdorff dimension was solved by J. Miller in [14], where the author constructs a Turing degree of non-integral Hausdorff dimension. In this article we settle the Dimension Problem for effective packing dimension by constructing a real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (on the other hand, it is known via [10, 3, 7] that every real of strictly positive effective Hausdorff dimension (...) computes reals whose effective packing dimensions are arbitrarily close to, but not necessarily equal to, one). (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)

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 computation can specify general patterns of causal organization, and 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)

In this paper I criticize a view of functional localization in neuroscience, which I call “computational absolutism”. “Absolutism” in general is the view that each part of the brain should be given a single, univocal function ascription. Traditional varieties of absolutism posit that each part of the brain processes a particular type of information and/or performs a specific task. These function attributions are currently beset by physiological evidence which seems to suggest that brain areas are multifunctional—that they process distinct information (...) and perform different tasks depending on context. Many theorists take this contextual variation as inimical to successful localization, and claim that we can avoid it by changing our functional descriptions to computational descriptions. The idea is that we can have highly generalizable and predictive functional theories if we can discover a single computation performed by each area regardless of the specific context in which it operates. I argue, drawing on computational models of perceptual area MT, that this computational version of absolutism fails to come through on its promises. In MT, the modeling field has not produced a univocal computational description, but instead a plurality of models analyzing different aspects of MT function. Moreover, CA cannot appeal to theoretical unification to solve this problem, since highly general models, on their own, neither explain nor predict what MT does in any particular context. I close by offering a perspective on neural modeling inspired by Nancy Cartwright’s and Margaret Morrison’s views of modeling in the physical sciences. (shrink)

What''s computation? The received answer is that computation is a computer at work, and a computer at work is that which can be modelled as a Turing machine at work. Unfortunately, as John Searle has recently argued, and as others have agreed, the received answer appears to imply that AI and Cog Sci are a royal waste of time. The argument here is alarmingly simple: AI and Cog Sci (of the Strong sort, anyway) are committed to the view that cognition (...) is computation (or brains are computers); butall processes are computations (orall physical things are computers); so AI and Cog Sci are positively silly.I refute this argument herein, in part by defining the locutions x is a computer and c is a computation in a way that blocks Searle''s argument but exploits the hard-to-deny link between What''s Computation? and the theory of computation. However, I also provide, at the end of this essay, an argument which, it seems to me, implies not that AI and Cog Sci are silly, but that they''re based on a form of computation that is well beneath human persons. (shrink)

This book provides a sustained and penetrating critique of a wide range of views in modern cognitive science and philosophy of the mind, from Turing's famous test for intelligence in machines to recent work in computational linguistic theory. While discussing many of the key arguments and topics, the authors also develop a distinctive analytic approach. Drawing on the methods of conceptual analysis first elaborated by Wittgenstein and Ryle, the authors seek to show that these methods still have a great deal (...) to offer in the field of the cognitive theory and the philosophy of mind, providing a powerful alternative to many of the positions put forward in the contemporary literature. Amoung the many issues discussed in the book are the following: the Cartesian roots of modern conceptions of mind; Searle's 'Chinese Room' thought experiment; Fodor's 'language of thought' hypothesis; the place of 'folk psychology' in cognitivist thought; and the question of whether any machine may be said to 'think' or 'understand' in the ordinary senses of these words. Wide ranging, up-to-date and forcefully argued, this book represents a major intervention in contemporary debates about the status of cognitive science an the nature of mind. It will be of particular interest to students and scholars in philosophy, psychology, linguistics and computing sciences. (shrink)

In an attempt to determine the epistemic status of computer simulation results, philosophers of science have recently explored the similarities and differences between computer simulations and experiments. One question that arises is whether and, if so, when, simulation results constitute novel empirical data. It is often supposed that computer simulation results could never be empirical or novel because simulations never interact with their targets, and cannot go beyond their programming. This paper argues against this position by examining whether, and under (...) what conditions, the features of empiricality and novelty could be displayed by computer simulation data. I show that, to the extent that certain familiar measurement results have these features, so can some computer simulation results. (shrink)

The question of where, between theory and experiment, computer simulations (CSs) locate on the methodological map is one of the central questions in the epistemology of simulation (cf. Saam Journal for General Philosophy of Science, 48, 293–309, 2017). The two extremes on the map have them either be a kind of experiment in their own right (e.g. Barberousse et al. Synthese, 169, 557–574, 2009; Morgan 2002, 2003, Journal of Economic Methodology, 12(2), 317–329, 2005; Morrison Philosophical Studies, 143, 33–57, 2009; Morrison (...) 2015; Massimi and Bhimji Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics, 51, 71–81, 2015; Parker Synthese, 169, 483–496, 2009) or just an argument executed with the aid of a computer (e.g. Beisbart European Journal for Philosophy of Science, 2, 395–434, 2012; Beisbart and Norton International Studies in the Philosophy of Science, 26, 403–422, 2012). There exist multiple versions of the first kind of position, whereas the latter is rather unified. I will argue that, while many claims about the ‘experimental’ status of CSs seem unjustified, there is a variant of the first position that seems preferable. In particular I will argue that while CSs respect the logic of (deductively valid) arguments, they neither agree with their pragmatics nor their epistemology. I will then lay out in what sense CSs can fruitfully be seen as experiments, and what features set them apart from traditional experiments nonetheless. I conclude that they should be seen as surrogate experiments, i.e. experiments executed consciously on the wrong kind of system, but with an exploitable connection to the system of interest. Finally, I contrast my view with that of Beisbart (European Journal for Philosophy of Science, 8, 171–204, 2018), according to which CSs are surrogates for experiments, arguing that this introduces an arbitrary split between CSs and other kinds of simulations. (shrink)

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

We consider the following problem for various infinite-time machines. If a real is computable relative to a large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent of ZFC for ordinal Turing machines with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider infinite-time Turing machines, (...) unresetting and resetting infinite-time register machines, and α-Turing machines for countable admissible ordinals α. (shrink)

Our article examines how journalistic reports and online comments have made sense of computational politics. It treats the discourse around data-driven campaigns as its object of analysis and codifies four main perspectives that have structured the debates about the use of large data sets and data analytics in elections. We study American, British, and German sources on the 2016 United States presidential election, the 2017 United Kingdom general election, and the 2017 German federal election. There, groups of speakers maneuvered between (...) enthusiastic, skeptical, agnostic, or admonitory stances and so cannot be clearly mapped onto these four discursive positions. Coming along with the inconsistent accounts, public sensemaking was marked by an atmosphere of speculation about the substance and effects of computational politics. We conclude that this equivocality helped journalists and commentators to sideline prior reporting on the issue in order to repeatedly rediscover the practices they had already covered. (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)

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)

Many philosophical and public discussions of the ethical aspects of violent computer games typically centre on the relation between playing violent videogames and its supposed direct consequences on violent behaviour. But such an approach rests on a controversial empirical claim, is often one-sided in the range of moral theories used, and remains on a general level with its focus on content alone. In response to these problems, I pick up Matt McCormick’s thesis that potential harm from playing computer games is (...) best construed as harm to one’s character, and propose to redirect our attention to the question how violent computer games influence the moral character of players. Inspired by the work of Martha Nussbaum, I sketch a positive account of how computer games can stimulate an empathetic and cosmopolitan moral development. Moreover, rather than making a general argument applicable to a wide spectrum of media, my concern is with specific features of violent computer games that make them especially morally problematic in terms of empathy and cosmopolitanism, features that have to do with the connections between content and medium, and between virtuality and reality. I also discuss some remaining problems. In this way I hope contribute to a less polarised discussion about computer games that does justice to the complexity of their moral dimension, and to offer an account that is helpful to designers, parents, and other stakeholders. (shrink)

University of Pennsylvania, USA, el322{at}nyu.edu ' + u + '@' + d + ' '//--> One of the most consistent findings in experimental studies of social dilemmas is the positive influence of face-to-face communication on cooperation. The face-to-face `communication effect' has been recently explained in terms of a `focus theory of norms': successful communication focuses agents on pro-social norms, and induces preferences and expectations conducive to cooperation. 1 Many of the studies that point to a communication effect, however, do (...) not further explore whether and to what extent the communication medium affects cooperative behavior. In this article, we ask if pro-social behavior can emerge and survive in computer-mediated environments. We show that, like face-to-face communication, computer-mediated communication also positively affects cooperation in social dilemmas, but cooperation is more difficult to establish and maintain. We argue that the discrepancy between the computer-mediated and the face-to-face communication effects is a consequence of the distinct capabilities of different media to focus agents on pro-social norms and to allow them to develop mutual expectations about future behavior. Key Words: social dilemmas • laboratory experiments • communication • social norms • cooperation • computer-mediated communication. (shrink)

The authors investigated the ontological argument computationally. The premises and conclusion of the argument are represented in the syntax understood by the automated reasoning engine PROVER9. Using the logic of definite descriptions, the authors developed a valid representation of the argument that required three non-logical premises. PROVER9, however, discovered a simpler valid argument for God's existence from a single non-logical premise. Reducing the argument to one non-logical premise brings the investigation of the soundness of the argument into better focus. Also, (...) the simpler representation of the argument brings out clearly how the ontological argument constitutes an early example of a ?diagonal argument? and, moreover, one used to establish a positive conclusion rather than a paradox. (shrink)

Detractors of Searle’s Chinese Room Argument have arrived at a virtual consensus that the mental properties of the Man performing the computations stipulated by the argument are irrelevant to whether computational cognitive science is true. This paper challenges this virtual consensus to argue for the first of the two main theses of the persons reply, namely, that the mental properties of the Man are what matter. It does this by challenging many of the arguments and conceptions put forth by the (...) systems and logical replies to the Chinese Room, either reducing them to absurdity or showing how they lead, on the contrary, to conclusions the persons reply endorses. The paper bases its position on the Chinese Room Argument on additional philosophical considerations, the foundations of the theory of computation, and theoretical and experimental psychology. The paper purports to show how all these dimensions tend to support the proposed thesis of the persons reply. (shrink)

I critically review Raymond Turner’s Computational Artifacts – Towards a Philosophy of Computer Science by placing beside his position a rather different one, according to which computer science is a branch of, and is therefore subsumed by, immaterial formal logic.

In lieu of an abstract, here is a brief excerpt of the content:Astrology, Computers, and the VolksgeistDenis DuttonCarroll Righter is not a name you will recognize, unless, perhaps, you’re old enough and you grew up reading the Los Angeles Times. Righter was the Times’s astrologer, and encountering his name recently brought back a couple of memories from the early 1950s. I remember finding it strange that a man (he was pictured alongside his column) was called Carroll, though he didn’t spell (...) it like the girl who lived across the street. But especially I recall the fun we had when my father would read the horoscopes out loud and we’d compare them with the day’s events. Ours was a tough family for an astrologer to please, with rather different things happening to too many Aquarians, and a robust skepticism about anything of the sort later to be called “New Age.”How could I know that while we laughed and debated, somewhere else out there in the urban sprawl, Righter’s prognostications were being subjected to subtle and portentous analysis by that kingpin of the Frankfurt School, Theodor W. Adorno? Mirabile dictu, Adorno was living in L.A. at the time, and we now have his examination of Righter in The Stars Down to Earth, and Other Essays on the Irrational in Culture, edited with an excellent introduction by Stephen Crook (Routledge, $16.95). The result seems, now in the fullness of time, of mixed value and relevance. Adorno has produced an admirably accessible rhetoric of astrology, what he terms “content analysis.” In this, he is finding out for himself about the so-called cold-reading techniques of psychic consultation, practices long known to magicians and astrologers and only really understood by psychologists since Bertram Forer’s work in the 1940s. But beyond that, Adorno uses astrology to support and exemplify his theory of authoritarian irrationalism. As you might expect, this is more questionable. [End Page 424]To be sure, there are many intriguing observations throughout this mostly readable essay. In a passage perhaps even more true today than when it was written, Adorno says that a “climate of semi-erudition is the fertile breeding ground for astrology.” He refers to people who have gone just beyond the naive acceptance of the authority of science, but who don’t know enough, or who have not sufficiently developed “the power of thinking,” that they can replace such acceptance with anything better: “The semi-erudite vaguely wants to understand and is also driven by the narcissistic wish to prove superior to the plain people but he is not in a position to carry through complicated and detached intellectual operations.” In other words, quantum mechanics is pretty tough, but astrology offers sophisticated understanding of all reality in a few easy steps. Besides, astronomy is about those remote stars and planets out there—rather cold and impersonal. In Adorno’s apt title phrase, astrology brings it all down to earth, because it’s about the single most important thing in the universe: me. In an analogy that isn’t too far-fetched, he says that to the semi-erudite individual “astrology, just as other irrational creeds like racism, provides a short-cut by bringing the complex to a handy formula and offering at the same time the pleasant gratification that he who feels excluded from educational privileges nevertheless belongs to the minority of those who are ‘in the know.’” Someone once remarked that Scientology boosts self-esteem largely by giving semi-educated, degreeless persons impressive certificates to hang on their walls, and Adorno is right that there’s a similar syndrome at work with most New Age esoterica, including astrology. (In literary theory, there are no certificates, of course—you just have to learn the jargon.)Much to his credit, Adorno independently identifies many of the features of cold reading described by Forer and later writers, such as the persistent tendency of the client to personalize the general message. Of Righter’s “Follow up that intuition of yours,” or “Display that keen mind of yours,” Adorno says, “People who have any affinity at all to occultism are usually prepared to react to the information they are craving in such a way... (shrink)

I’m one of those who is awed and impressed by the potential of this field and have devoted some part of my energy to persuading people that it is a positive force. I have done so largely on the grounds of its economic benefits and it potential for making the fruits of computer technology more generally available to the public — for example, to help the overworked physician; to search for oil and minerals and help manage our valuable resources; (...) to explore, mine, and experimentindangerousenvironments;toallowthenon-computingpublicaccesstovast libraries of important information and even advice, and in the process give real meaning to the.. (shrink)

I would like to introduce the problematic to be addressed in this short article simply as follows. According to the majority of the modern interpreters of the Nyāya philosophy, the Naiyāyika-s are ontologically committed to an uncompromising direct realist theory of perception and to externalism both in epistemology and philosophy of mind. Computationalists, on the other hand, in their ontology, are frank or secret supporters of the view that what we cognize, even what we perceive, is representational. These two claims (...) appear to be opposed to each other. Naturally, the question arises: Is a computational account of intentional mental state, as proposed by Matilal, in his magnum opus Perception, admissible in the Navya-Nyāya framework? Though Matilal has not restricted the conundrum to Navya-Nyāya, the way he has analyzed the cognitive states are available only in the Navya-Nyāya literature. The main objective of this article is to strengthen Matilal’s position further with the help of some additional arguments from the Navya-Nyāya treatises. (shrink)

People and intelligent computers, if there ever are any, will both have to believe certain things in order to be intelligent agents at all, or to be a particular sort of intelligent agent. I distinguish implicit beliefs that are inherent in the architecture of a natural or artificial agent, in the way it is 'wired', from explicit beliefs that are encoded in a way that makes them easier to learn and to erase if proven mistaken. I introduce the term IFI, (...) which stands for irresistible framework intuition, for an implicit belief that can come into conflict with an explicit one. IFIs are a key element of any theory of consciousness that explains qualia and other aspects of phenomenology as second-order beliefs about perception. Before I can survey the IFI landscape, I review evidence that the brains of humans, and presumably of other intelligent agents, consist of many specialized modules that are capable of sharing a unified workspace on urgent occasions, and jointly model themselves as a single agent. I also review previous work relevant to my subject. Then I explore several IFIs, starting with, 'My future actions are free from the control of physical laws'. Most of them are universal, in the sense that they will be shared by any intelligent agent; the case must be argued for each IFI. When made explicit, IFIs may look dubious or counterproductive, but they really are irresistible, so we find ourselves in the odd position of oscillating between justified beliefs and conflicting but irresistible beliefs. We cannot hope that some process of argumentation will resolve the conflict. (shrink)

The authors investigated the ontological argument computationally. The premises and conclusion of the argument are represented in the syntax understood by the automated reasoning engine PROVER9. Using the logic of definite descriptions, the authors developed a valid representation of the argument that required three non-logical premises. PROVER9, however, discovered a simpler valid argument for God's existence from a single non-logical premise. Reducing the argument to one non-logical premise brings the investigation of the soundness of the argument into better focus. Also, (...) the simpler representation of the argument brings out clearly how the ontological argument constitutes an early example of a ‘diagonal argument’ and, moreover, one used to establish a positive conclusion rather than a paradox. (shrink)

Several evolutionary accounts of human social cognition posit that language has co-evolved with the sophisticated mindreading abilities of modern humans. It has also been argued that these mindreading abilities are the product of cultural, rather than biological, evolution. Taken together, these claims suggest that the evolution of language has played an important role in the cultural evolution of human social cognition. Here we present a new computational model which formalises the assumptions that underlie this hypothesis, in order to explore how (...) language and mindreading interact through cultural evolution. This model treats communicative behaviour as an interplay between the context in which communication occurs, an agent’s individual perspective on the world, and the agent’s lexicon. However, each agent’s perspective and lexicon are private mental representations, not directly observable to other agents. Learners are therefore confronted with the task of jointly inferring the lexicon and perspective of their cultural parent, based on their utterances in context. Simulation results show that given these assumptions, an informative lexicon evolves not just under a pressure to be successful at communicating, but also under a pressure for accurate perspective-inference. When such a lexicon evolves, agents become better at inferring others’ perspectives; not because their innate ability to learn about perspectives changes, but because sharing a language with others helps them to do so. (shrink)

The impact of induced mild positive feelings on working memory and complex decision making among older adults (aged 63–85) was examined. Participants completed a computer administered card task in which participants could win money if they chose from “gain” decks and lose money if they chose from “loss” decks. Individuals in the positive-feeling condition chose better than neutral-feeling participants and earned more money overall. Participants in the positive-feeling condition also demonstrated improved working-memory capacity. These effects of (...) class='Hi'>positive-feeling induction have implications for affect theory, as well as, potentially, practical implications for people of all ages dealing with complex decisions. (shrink)

Given the widespread acceptance of computational thinking in educational systems around the world, primary and higher education has begun thinking about how to cultivate students' CT competences. The artificial intelligence of things combines artificial intelligence and the Internet of things and involves integrating sensing technologies at the lowest level with relevant algorithms in order to solve real-world problems. Thus, it has now become a popular technological application for CT training. In this study, a novel AIoT learning with Augmented Reality technology (...) was proposed and explored the effect of CT skills. The students used AR applications to understand AIoT applications in practice, attempted the placement of different AR sensors in actual scenarios, and further generalized and designed algorithms. Based on the results of the experimental course, we explored the influence of prior knowledge and usage intention on students' CT competence training. The results show that proposed AIoT learning can increase students' learning intention and that they had a positive impact on problem solving and comprehension with AR technology, as well as application planning and design. (shrink)

We study the position of the computable setting in the “common theory of locality” developed in [4, 5] for local problems on $\Delta $ -regular trees, $\Delta \in \omega $. We show that such a problem admits a computable solution on every highly computable $\Delta $ -regular forest if and only if it admits a Baire measurable solution on every Borel $\Delta $ -regular forest. We also show that if such a problem admits a computable solution on every computable maximum (...) degree $\Delta $ forest then it admits a continuous solution on every maximum degree $\Delta $ Borel graph with appropriate topological hypotheses, though the converse does not hold. (shrink)

The rejection of behaviorism in the 1950s and 1960s led to the view, due mainly to Noam Chomsky, that language must be studied by looking at the mind and not just at behavior. It is an understatement to say that Chomskyan linguistics dominates the field. Despite being the overwhelming majority view, it has not gone unchallenged, and the challenges have focused on different aspects of the theory. What is almost universally accepted, however, is Chomsky’s view that understanding language demands a (...) theory that posits mental states that represent rules of language. Call this claim, following Cowie (1999), Representationalism or (R). According to (R), ‘‘[e]xplaining language mastery and acquisition requires the postulation of contentful mental states and processes involving their manipulation’’ (Cowie, 1999, p. 154). Although (R) is nothing more than the general assumption on which cognitive psychology is founded applied to the case of language, even it has had its detractors. Critics have argued that linguistic competence should not in fact be thought of as based on the possession of a body of linguistic knowledge but should be thought of, rather, as a kind of skill. This is an important challenge because one might be inclined to think that no recognizable form of Chomskyan linguistics could withstand the falsification of (R). In this paper we attempt to show that in fact (R) could be false without doing much damage to Chomskyan linguistics at all. Indeed, it is possible that the Chomskyan position could be made more coherent by adopting the view we will sketch. Our claim, therefore, is that critics of (R) might be right, but that this does not obviously make them serious critics of the Chomskyan program. (shrink)

The term ‘the artificial’ can only be given a precise meaning in the context of the evolution of computational technology and this in turn can only be fully understood within a cultural setting that includes an epistemological perspective. The argument is illustrated in two case studies from the history of computational machinery: the first calculating machines and the first programmable computers. In the early years of electronic computers, the dominant form of computing was data processing which was a reflection (...) of the dominant philosophy of logical positivism. By contrast, artificial intelligence (AI) adopted an anti-positivist position which left it marginalised until the 1980s when two camps emerged: technical AI which reverted to positivism, and strong AI which reified intelligence. Strong AI's commitment to the computer as a symbol processing machine and its use of models links it to late-modernism. The more directly experiential Virtual Reality (VR) more closely reflects the contemporary cultural climate of postmodernism. It is VR, rather than AI, that is more likely to form the basis of a culture of the artificial. (shrink)

Argument-mapping software abounds, and one of the reasons is that using the software has been shown to teach/promote/improve critical thinking skills. These positive results are very encouraging, but they also raise the question of whether the computer tutorial environment is producing these results, or whether learning argument mapping, even with just paper and pencil, is sufficient. Based on the results of two empirical studies, I argue that the basic skill of being able to represent an argument diagrammatically plays an (...) important role in the improvement of critical-thinking skills. While these studies do not offer a direct comparison between the two methods, it is important for anyone wishing to employ argument mapping in the classroom to know that significant results can be obtained even with the most rudimentary of tools. (shrink)

Since the birth of computing as an academic discipline, the disciplinary identity of computing has been debated fiercely. The most heated question has concerned the scientific status of computing. Some consider computing to be a natural science and some consider it to be an experimental science. Others argue that computing is bad science, whereas some say that computing is not a science at all. This survey article presents viewpoints for and against computing as (...) a science. Those viewpoints are analyzed against basic positions in the philosophy of science. The article aims at giving the reader an overview, background, and a historical and theoretical frame of reference for understanding and interpreting some central questions in the debates about the disciplinary identity of computer science. The article argues that much of the discussion about the scientific nature of computing is misguided due to a deep conceptual uncertainty about science in general as well as computing in particular. (shrink)

There seems to exist an indirect link between computer science and theology via psychology, which is founded on dualism. First, these theories from psychology, computer science and theology are considered that acknowledge the existence of (at least) two different kinds of reality, or, possibly, two different realms of the same reality. In order to express a root of incompatibility of science and theology, a distinction is drawn between ontological and epistemological dualism. It seems that computer science combines ontological monism with (...) epistemological monism, theology combines ontological and epistemological dualism, and psychologytakes a position of epistemological monism and is quite hesitant about the ontological status of the phenomena it analyzes. A direct transition from the computer metaphor to theology is almost impossible: there is no overlap of platforms between these domains. (shrink)

We propose a non-representationalist framework for deep learning relying on a novel method computational phenomenology, a dialogue between the first-person perspective (relying on phenomenology) and the mechanisms of computational models. We thereby propose an alternative to the modern cognitivist interpretation of deep learning, according to which artificial neural networks encode representations of external entities. This interpretation mainly relies on neuro-representationalism, a position that combines a strong ontological commitment towards scientific theoretical entities and the idea that the brain operates on symbolic (...) representations of these entities. We proceed as follows: after offering a review of cognitivism and neuro-representationalism in the field of deep learning, we first elaborate a phenomenological critique of these positions; we then sketch out computational phenomenology and distinguish it from existing alternatives; finally we apply this new method to deep learning models trained on specific tasks, in order to formulate a conceptual framework of deep-learning, that allows one to think of artificial neural networks’ mechanisms in terms of lived experience. (shrink)

Based on results of an experiment, hypotheses are tested concerning the effects of computer use on decision commitment. The experiment required subjects to make an adoption decision regarding a hypothetical government agency's innovation. Subjects could choose from a variety of information sets, some computer based, some not, before making the decision. After their decision the subjects were given “new evidence” that contradicted their initial position. Two experimental treatments included more difficult access to the computer-based information and higher cost for the (...) computer-based information. Results indicate that access difficulty diminishes confidence in decisions and leads to lesser commitment. However, the cost of the computer information seems to have little bearing on decision commitment. (shrink)

With the mutual exchange and integration of world football, modern football is in an increasingly comprehensive direction. This research mainly discusses complexity computer simulation in the study of the overall play of campus football. Complexity computer simulation is used to design the background of the simulated football field, and the area is divided according to the size ratio of the actual football field. Then, it uses drawing software to draw the football and player controls. The construction of the knowledge base (...) of this paper is mainly combined with the functional modules of rapid formation and response tactics. In the fast formation function, the required formation can be quickly given through football experience and knowledge rules. In the applied tactics function, for the responsibilities of forwards, midfielders, defenders, and other roles, the tactics implemented are given, including partially coordinated offensive and defensive tactics, personal offensive and defensive tactics, and set-ball tactics. The “holistic play” football tactics studied in this paper use XML files as recording and playback data, which not only greatly reduce the amount of file data but also make the operation of XML files intuitive and simple. XML can not only realize the recording and playback of player and football track but also be used in the function of rapid formation. The coach uses the “holistic play” football tactics simulation to demonstrate the movement route through the image, guide the players in each position to perceive the game scene by observing the movement route, and analyze and judge the tactical coordination of their respective positions. The computer simulation tactical analysis of the precision of the passing and running and the path coefficient of the passing factor is 0.606 and 0.59, respectively. This research helps to provide guidance on the overall playing tactics of football. (shrink)

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

Given a program of a linear bounded and bijective operator T, does there exist a program for the inverse operator T−1? And if this is the case, does there exist a general algorithm to transfer a program of T into a program of T−1? This is the inversion problem for computable linear operators on Banach spaces in its non-uniform and uniform formulation, respectively. We study this problem from the point of view of computable analysis which is the Turing machine based (...) theory of computability on Euclidean space and other topological spaces. Using a computable version of Banach’s Inverse Mapping Theorem we can answer the first question positively. Hence, the non-uniform version of the inversion problem is solvable, while a topological argument shows that the uniform version is not. Thus, we are in the striking situation that any computable linear operator has a computable inverse while there exists no general algorithmic procedure to transfer a program of the operator into a program of its inverse. As a consequence, the computable version of Banach’s Inverse Mapping Theorem is a powerful tool which can be used to produce highly non-constructive existence proofs of algorithms. We apply this method to prove that a certain initial value problem admits a computable solution. As a preparation of Banach’s Inverse Mapping Theorem we also study the Open Mapping Theorem and we show that the uniform versions of both theorems are limit computable, which means that they are effectively -measurable with respect to the effective Borel hierarchy. (shrink)

In this position paper, we have used Alan Cooper’s persona technique to illustrate the utility of audio- and video-based AAL technologies. Therefore, two primary examples of potential audio- and video-based AAL users, Anna and Irakli, serve as reference points for describing salient ethical, legal and social challenges related to use of AAL. These challenges are presented on three levels: individual, societal, and regulatory. For each challenge, a set of policy recommendations is suggested.

Decision making often takes place in social environments where other actors influence individuals' decisions. The present article examines how advice affects individual learning. Five social learning models combining advice and individual learning‐four based on reinforcement learning and one on Bayesian learning‐and one individual learning model are tested against each other. In two experiments, some participants received good or bad advice prior to a repeated multioption choice task. Receivers of advice adhered to the advice, so that good advice improved performance. The (...) social learning models described the observed learning processes better than the individual learning model. Of the models tested, the best social learning model assumes that outcomes from recommended options are more positively evaluated than outcomes from nonrecommended options. This model correctly predicted that receivers first adhere to advice, then explore other options, and finally return to the recommended option. The model also predicted accurately that good advice has a stronger impact on learning than bad advice. One‐time advice can have a long‐lasting influence on learning by changing the subjective evaluation of outcomes of recommended options. (shrink)

A. N. Turing’s 1936 concept of computability, computing machines, and computable binary digital sequences, is subject to Turing’s Cardinality Paradox. The paradox conjoins two opposed but comparably powerful lines of argument, supporting the propositions that the cardinality of dedicated Turing machines outputting all and only the computable binary digital sequences can only be denumerable, and yet must also be nondenumerable. Turing’s objections to a similar kind of diagonalization are answered, and the implications of the paradox for the concept of (...) a Turing machine, computability, computable sequences, and Turing’s effort to prove the unsolvability of the Entscheidungsproblem, are explained in light of the paradox. A solution to Turing’s Cardinality Paradox is proposed, positing a higher geometrical dimensionality of machine symbol-editing information processing and storage media than is available to canonical Turing machine tapes. The suggestion is to add volume to Turing’s discrete two-dimensional machine tape squares, considering them instead as similarly ideally connected massive three-dimensional machine information cells. Three-dimensional computing machine symbol-editing information processing cells, as opposed to Turing’s two-dimensional machine tape squares, can take advantage of a denumerably infinite potential for parallel digital sequence computing, by which to accommodate denumerably infinitely many computable diagonalizations. A three-dimensional model of machine information storage and processing cells is recommended on independent grounds as better representing the biological realities of digital information processing isomorphisms in the three-dimensional neural networks of living computers. (shrink)