Results for 'computing'

979 found
Order:
See also
  1. The fortieth annual lecture series 1999-2000.Brain Computations & an Inevitable Conflict - 2000 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 31:199-200.
  2. Section 2. Model Theory.Va Vardanyan, On Provability Resembling Computability, Proving Aa Voronkov & Constructive Logic - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen, Logic, methodology, and philosophy of science VIII: proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. New York, NY, U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science.
    No categories
     
    Export citation  
     
    Bookmark  
  3.  11
    A Model for Proustian Decay.Computer Lars - 2024 - Nordic Journal of Aesthetics 33 (67).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. Randomness and Recursive Enumerability.Siam J. Comput - unknown
    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. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  10
    Computer Science Logic: 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers.M. Nielsen, Wolfgang Thomas & European Association for Computer Science Logic - 1998 - Springer Verlag.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  6. Paul M. kjeldergaard.Pittsburgh Computations Centers - 1968 - In T. Dixon & Deryck Horton, Verbal Behavior and General Behavior Theory. Prentice-Hall.
    No categories
     
    Export citation  
     
    Bookmark  
  7.  22
    Hector freytes, Antonio ledda, Giuseppe sergioli and.Roberto Giuntini & Probabilistic Logics in Quantum Computation - 2013 - In Hanne Andersen, Dennis Dieks, Wenceslao J. Gonzalez, Thomas Uebel & Gregory Wheeler, New Challenges to Philosophy of Science. Springer Verlag. pp. 49.
    Direct download  
     
    Export citation  
     
    Bookmark  
  8. The general problem of the primitive was finally solved in 1912 by A. Den-joy. But his integration process was more complicated than that of Lebesgue. Denjoy's basic idea was to first calculate the definite integral∫ b. [REVIEW]How to Compute Antiderivatives - 1995 - Bulletin of Symbolic Logic 1 (3).
     
    Export citation  
     
    Bookmark  
  9. An Introduction to Lorenzen's ‘Algebraic and Logistic Investigations on Free Lattices’ (1951).Thierry Coquand Henri Lombardi Stefan Neuwirth A. Computer Science - forthcoming - History and Philosophy of Logic:1-21.
    Lorenzen's article has immediately been recognised as a landmark in the history of infinitary proof theory. We propose a translation and this introduction in order to publicise its approach and method of proof, without any ordinal assignment. It is best known for providing a constructive proof of consistency for ramified type theory without axiom of reducibility by showing that it is a part of a trivially consistent ‘inductive calculus’ that describes our knowledge of arithmetic without detour; the proof resorts only (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  3
    Adventures in Gödel Incompleteness.Harvey M. Friedman Mathematics, Philosophy, Computer Science Emeritus, Columbus, Oh & Usa - forthcoming - History and Philosophy of Logic:1-14.
    Begin discussing various forms of G1 put into the form: If a first order theory satisfies one or more adequacy conditions then it has one or more wildness properties. We continue with the new ‘no interpretation’ forms of G2, which are fundamentally model theoretic formulations. We also give corresponding model theoretic characterizations of the consistency statement Con(T) for finitely axiomatized T. We present the known proof of the 1-Con form by G2 by transparent diagonalization and discuss attempts to do so (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  9
    A logical formalisation of false belief tasks.R. Velázquez-Quesada A. Institute for Logic Anthia Solaki Fernando, Computation Language, Netherlandsb Netherlands Organization for Applied Scientific Research, Media Studies Netherlandsc Information Science & Norway - forthcoming - Journal of Applied Non-Classical Logics:1-51.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  5
    Intentional identity revisited.Ahti Pietarinen A. School of Cognitive, Computing Sciences, Falmer, Brighton, BN1 9QH & Uk - 2010 - Nordic Journal of Philosophical Logic 6 (2):147-188.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  13.  11
    Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning about Knowledge: March 19-22, 1988, Monterey, California.Joseph Y. Halpern, International Business Machines Corporation, American Association of Artificial Intelligence, United States & Association for Computing Machinery - 1986
    Direct download  
     
    Export citation  
     
    Bookmark  
  14. Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   108 citations  
  15.  34
    Computational Models and Virtual Reality. New Perspectives of Research in Chemistry.Klaus Mainzer - 1999 - Hyle 5 (2):135 - 144.
    Molecular models are typical topics of chemical research depending on the technical standards of observation, computation, and representation. Mathematically, molecular structures have been represented by means of graph theory, topology, differential equations, and numerical procedures. With the increasing capabilities of computer networks, computational models and computer-assisted visualization become an essential part of chemical research. Object-oriented programming languages create a virtual reality of chemical structures opening new avenues of exploration and collaboration in chemistry. From an epistemic point of view, virtual reality (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  16.  24
    Computability of solutions of operator equations.Volker Bosserhoff - 2007 - Mathematical Logic Quarterly 53 (4):326-344.
    We study operator equations within the Turing machine based framework for computability in analysis. Is there an algorithm that maps pairs to solutions of Tx = u ? Here we consider the case when T is a bounded linear mapping between Hilbert spaces. We are in particular interested in computing the generalized inverse T†u, which is the standard concept of solution in the theory of inverse problems. Typically, T† is discontinuous and hence no computable mapping. However, we will use (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Computation and cognition: Issues in the foundation of cognitive science.Zenon W. Pylyshyn - 1980 - Behavioral and Brain Sciences 3 (1):111-32.
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   668 citations  
  18.  90
    A Computational Approach to Quantifiers as an Explanation for Some Language Impairments in Schizophrenia.Marcin Zajenkowski, Rafał Styła & Jakub Szymanik - 2011 - Journal of Communication Disorder 44:2011.
    We compared the processing of natural language quantifiers in a group of patients with schizophrenia and a healthy control group. In both groups, the difficulty of the quantifiers was consistent with computational predictions, and patients with schizophrenia took more time to solve the problems. However, they were significantly less accurate only with proportional quantifiers, like more than half. This can be explained by noting that, according to the complexity perspective, only proportional quantifiers require working memory engagement.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  19.  32
    Quantum Computation and Quantum Information.Michael A. Nielsen & Isaac L. Chuang - 2000 - Cambridge University Press.
    First-ever comprehensive introduction to the major new subject of quantum computing and quantum information.
    Direct download  
     
    Export citation  
     
    Bookmark   216 citations  
  20.  60
    Physical Computation: A Mechanistic Account.Gualtiero Piccinini - 2015 - Oxford, GB: Oxford University Press UK.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   139 citations  
  21. A computational foundation for the study of cognition.David Chalmers - 2011 - Journal of Cognitive Science 12 (4):323-357.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   101 citations  
  22. The Computational Theory of Mind.John-Michael Kuczynski - 2014 - Madison, WI, USA: Philosophypedia.
    The widespread belief that the mind is a computer embodies a failure to distinguish between computers and information-processing systems. Minds are information-processing systems, but they are not computers.
     
    Export citation  
     
    Bookmark  
  23.  70
    Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  24.  23
    Computability of Minimizers and Separating Hyperplanes.Kam-Chau Wong - 1996 - Mathematical Logic Quarterly 42 (1):564-568.
    We prove in recursive analysis an existence theorem for computable minimizers of convex computable continuous real-valued functions, and a computable separation theorem for convex sets in ℝm.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  25
    Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.
    We present a model of computation for string functions over single-sorted, total algebraic structures and study some basic features of a general theory of computability within this framework. Our concept generalizes the Blum-Shub-Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of fixed length, some suppositions of deeper results within former approaches to generalized recursion theory become superfluous. Moreover, this gives the basis for introducing computational complexity in a BSS-like (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  22
    Computer Science: features of Russian classification.Tatiana D. Sokolova - 2018 - Epistemology and Philosophy of Science 55 (1):31-35.
    The article deals with Russian scientific classifications (GRNTI, VAK) of computer science in comparison with Western scien­tific classifications Fields of Science and Technology (FOS) and Universal Decimal Classification (UDS). The author analyzes the basics and principles of these classifications, identifies their strong and weak points as well as their influence on the devel­opment of computer sciences. She also provides some recom­mendations on adjustments of Russian scientific classifications aiming to make them more flexible and adaptive to the faster scientific and technological (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27. Computation and Cognition: Toward a Foundation for Cognitive Science.Zenon W. Pylyshyn - 1984 - Cambridge: MIT Press.
    This systematic investigation of computation and mental phenomena by a noted psychologist and computer scientist argues that cognition is a form of computation, that the semantic contents of mental states are encoded in the same general way as computer representations are encoded. It is a rich and sustained investigation of the assumptions underlying the directions cognitive science research is taking. 1 The Explanatory Vocabulary of Cognition 2 The Explanatory Role of Representations 3 The Relevance of Computation 4 The Psychological Reality (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1069 citations  
  28. (1 other version)Computing machinery and intelligence.Alan Turing - 1950 - Mind 59 (236):433-60.
    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 (...)
    Direct download (20 more)  
     
    Export citation  
     
    Bookmark   1166 citations  
  29. Extending Ourselves: Computational Science, Empiricism, and Scientific Method.Paul Humphreys - 2004 - New York, US: Oxford University Press.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   340 citations  
  30. Content, computation and externalism.Oron Shagrir - 2001 - Mind 110 (438):369-400.
    The paper presents an extended argument for the claim that mental content impacts the computational individuation of a cognitive system (section 2). The argument starts with the observation that a cognitive system may simultaneously implement a variety of different syntactic structures, but that the computational identity of a cognitive system is given by only one of these implemented syntactic structures. It is then asked what are the features that determine which of implemented syntactic structures is the computational structure of the (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   75 citations  
  31.  25
    Examining computers & society 1970--2008.Joseph D. Oldham - 2009 - Acm Sigcas Computers and Society 39 (2):34-42.
    This paper is a review of 39 years of SIGCAS publications in Computers and Society, the newsletter of ACM SIGCAS. The publication is archived in the ACM Digital Library [12]. I set out to examine SIGCAS through its publications.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  32. A Computational Constructivist Model as an Anticipatory Learning Mechanism for Coupled Agent–Environment Systems.F. S. Perotto - 2013 - Constructivist Foundations 9 (1):46-56.
    Context: The advent of a general artificial intelligence mechanism that learns like humans do would represent the realization of an old and major dream of science. It could be achieved by an artifact able to develop its own cognitive structures following constructivist principles. However, there is a large distance between the descriptions of the intelligence made by constructivist theories and the mechanisms that currently exist. Problem: The constructivist conception of intelligence is very powerful for explaining how cognitive development takes place. (...)
     
    Export citation  
     
    Bookmark   1 citation  
  33. On computational explanations.Anna-Mari Rusanen & Otto Lappi - 2016 - Synthese 193 (12):3931-3949.
    Computational explanations focus on information processing required in specific cognitive capacities, such as perception, reasoning or decision-making. These explanations specify the nature of the information processing task, what information needs to be represented, and why it should be operated on in a particular manner. In this article, the focus is on three questions concerning the nature of computational explanations: What type of explanations they are, in what sense computational explanations are explanatory and to what extent they involve a special, “independent” (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  34.  22
    Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
    In this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets. The paper concludes with a comprehensive examination of the Effective Riemann Mapping Theorem and related questions.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  62
    Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
    Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  36. Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
    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 (...)
  37. Computer Models On Mind: Computational Approaches In Theoretical Psychology.Margaret A. Boden - 1988 - Cambridge University Press.
    What is the mind? How does it work? How does it influence behavior? Some psychologists hope to answer such questions in terms of concepts drawn from computer science and artificial intelligence. They test their theories by modeling mental processes in computers. This book shows how computer models are used to study many psychological phenomena--including vision, language, reasoning, and learning. It also shows that computer modeling involves differing theoretical approaches. Computational psychologists disagree about some basic questions. For instance, should the mind (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   71 citations  
  38.  21
    Online, computable and punctual structure theory.Matthew Askes & Rod Downey - 2023 - Logic Journal of the IGPL 31 (6):1251-1293.
    Several papers (e.g. [7, 23, 42]) have recently sought to give general frameworks for online structures and algorithms ([4]), and seeking to connect, if only by analogy, online and computable structure theory. These initiatives build on earlier work on online colouring and other combinatorial algorithms by Bean [10], Kierstead, Trotter et al. [48, 54, 57] and others, as we discuss below. In this paper we will look at such frameworks and illustrate them with examples from the first author’s MSc Thesis (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  59
    The Computational and Neural Basis of Cognitive Control: Charted Territory and New Frontiers.Matthew M. Botvinick - 2014 - Cognitive Science 38 (6):1249-1285.
    Cognitive control has long been one of the most active areas of computational modeling work in cognitive science. The focus on computational models as a medium for specifying and developing theory predates the PDP books, and cognitive control was not one of the areas on which they focused. However, the framework they provided has injected work on cognitive control with new energy and new ideas. On the occasion of the books' anniversary, we review computational modeling in the study of cognitive (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  40. Neural Computation and the Computational Theory of Cognition.Gualtiero Piccinini & Sonya Bahar - 2013 - Cognitive Science 37 (3):453-488.
    We begin by distinguishing computationalism from a number of other theses that are sometimes conflated with it. We also distinguish between several important kinds of computation: computation in a generic sense, digital computation, and analog computation. Then, we defend a weak version of computationalism—neural processes are computations in the generic sense. After that, we reject on empirical grounds the common assimilation of neural computation to either analog or digital computation, concluding that neural computation is sui generis. Analog computation requires continuous (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   72 citations  
  41.  72
    Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
    The first-order logical theory Th $({\mathbb{N}},x + 1,F(x))$ is proved to be complete for the class ATIME-ALT $(2^{O(n)},O(n))$ when $F(x) = 2^{x}$ , and the same result holds for $F(x) = c^{x}, x^{c} (c \in {\mathbb{N}}, c \ge 2)$ , and F(x) = tower of x powers of two. The difficult part is the upper bound, which is obtained by using a bounded Ehrenfeucht–Fraïssé game.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  42. Computational explanation in neuroscience.Gualtiero Piccinini - 2006 - Synthese 153 (3):343-353.
    According to some philosophers, computational explanation is proprietary
    to psychology—it does not belong in neuroscience. But neuroscientists routinely offer computational explanations of cognitive phenomena. In fact, computational explanation was initially imported from computability theory into the science of mind by neuroscientists, who justified this move on neurophysiological grounds. Establishing the legitimacy and importance of computational explanation in neuroscience is one thing; shedding light on it is another. I raise some philosophical questions pertaining to computational explanation and outline some promising answers that (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   58 citations  
  43. Computer Simulations in Science and Engineering. Concept, Practices, Perspectives.Juan Manuel Durán - 2018 - Springer.
    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 (...)
  44.  12
    Ubiquitous Computing.Klaus Wiegerling - 2013 - In Armin Grunwald, Handbuch Technikethik. Stuttgart: Metzler. pp. 419-423.
    Ubiquitous Computing bezeichnet keine konkrete Technologie, sondern eine informatische Vision allgegenwärtiger Datenverarbeitung und Nutzung informatischer Systeme, bei der es weder nennenswerte Bedienungsanforderungen noch Hardwarebelastungen für den Nutzer gibt. Ubiquitäre Systeme agieren quasi unsichtbar im Hintergrund unseres Handlungsfeldes. Die bisherigen Realisierungen sind in unterschiedlichen informatischen und nachrichtentechnischen Technologien konkretisiert.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  45. Cognitive Computation sans Representation.Paul Schweizer - 2017 - In Thomas M. Powers, Philosophy and Computing: Essays in epistemology, philosophy of mind, logic, and ethics. Cham: Springer. pp. 65-84.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  46. Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
    Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   125 citations  
  47.  17
    Computer Versus Microscope: Visual Activity Fields of Instruments in the Information Age.Mauro Turrini - 2013 - Spontaneous Generations 7 (1):81-93.
    The increasing concern about visual representation in science has been usually converged on representations – photographs, diagrams, graphs, maps –, while instruments of visualization have been usually neglected, even because of the concrete difficulty to grasp their effects on visualization. In this regard, the questions and concepts formulated in the debate on digital visualization deserve here as a starting point to analyze the change in instrumental mediation triggered by the introduction of computer-assisted imaging technologies in those laboratories that traditionally have (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48.  8
    Computational physics: an introduction.Franz Vesely - 2001 - New York: Kluwer Academic/Plenum Publishers.
    Vesely (experimental physics, U. of Vienna, Austria) provides the basic numerical and computational techniques, followed by an explanation of specific problems of computational physics. Appendices address properties of computing machines and an outline of the technique of Fast Fourier Transformation. The first edition, published by Plenum Press, Ne.
    Direct download  
     
    Export citation  
     
    Bookmark  
  49.  45
    Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
    This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   46 citations  
  50.  73
    A Probabilistic Computational Model of Cross-Situational Word Learning.Afsaneh Fazly, Afra Alishahi & Suzanne Stevenson - 2010 - Cognitive Science 34 (6):1017-1063.
    Words are the essence of communication: They are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisition: Children must first learn words before they can combine them into complex utterances. Many theories have been developed to explain the impressive efficiency of young children in acquiring the vocabulary of their language, as well as the developmental patterns observed in the course of lexical acquisition. A major source of disagreement (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   27 citations  
1 — 50 / 979