Results for 'computation'

970 found
Order:
  1. 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  
  2. 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.
  3.  10
    A Model for Proustian Decay.Computer Lars - 2024 - Nordic Journal of Aesthetics 33 (67).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  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  
  5. 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  
  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. 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  
  8.  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  
  9.  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  
  10. 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.  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  
  12. 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  
  13. 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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1069 citations  
  14.  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  
  15.  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  
  16.  12
    Computing and Philosophy in Asia.Soraj Hongladarom (ed.) - 2007 - Cambridge Scholars Press.
    This volume is a collection of selected papers presented at the Second Asia-Pacific Computing and Philsosophy Conference, which was held in Bangkok, Thailand in January 2005. The conference was organized by the Center for Ethics of Science and Technology, Chulalongkorn University on behalf of the International Association of Computing and Philosophy (www.ia-cap.org). Computing have had a long relationship with philosophy, starting from the problem of how symbols being manipulated in computing bear a relation to the outside world, to those of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  30
    Computability in Context: Computation and Logic in the Real World.S. B. Cooper & Andrea Sorbi (eds.) - 2011 - World Scientific.
    Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions ...
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  40
    A Computational Model of the Self-Teaching Hypothesis Based on the Dual-Route Cascaded Model of Reading.Stephen C. Pritchard, Max Coltheart, Eva Marinus & Anne Castles - 2018 - Cognitive Science 42 (3):722-770.
    The self‐teaching hypothesis describes how children progress toward skilled sight‐word reading. It proposes that children do this via phonological recoding with assistance from contextual cues, to identify the target pronunciation for a novel letter string, and in so doing create an opportunity to self‐teach new orthographic knowledge. We present a new computational implementation of self‐teaching within the dual‐route cascaded (DRC) model of reading aloud, and we explore how decoding and contextual cues can work together to enable accurate self‐teaching under a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  20
    Unconventional Computing, Arts, Philosophy.Andrew Adamatzky (ed.) - 2022 - World Scientific Publishing Company.
    The unique compendium re-assesses the value of future and emergent computing technologies via artistic and philosophical means. The book encourages scientists to adopt inspiring thinking of artists and philosophers to reuse scientific concepts in their works.The useful reference text consists of non-typical topics, where artistic and philosophical concepts encourage readers to adopt unconventional approaches towards computing and immerse themselves into discoveries of future emerging landscape.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  20. The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang, Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
    We study the computational complexity of reciprocal sentences with quantified antecedents. We observe a computational dichotomy between different interpretations of reciprocity, and shed some light on the status of the so-called Strong Meaning Hypothesis.
     
    Export citation  
     
    Bookmark   1 citation  
  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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   101 citations  
  22. 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  
  23. (1 other version)The computational model of the mind and philosophical functionalism.Richard Double - 1987 - Behaviorism 15 (2):131-39.
    A distinction between the use of computational models in cognitive science and a philosophically inspired reductivist thesis is developed. PF is found questionable for phenomenal states, and, by analogy, dubious for the nonphenomenal introspectible mental states of common sense. PF is also shown to be threatened for the sub-cognitive theoretical states of cognitive science by the work of the so-called New Connectionists. CMM is shown to be less vulnerable to these criticisms.
     
    Export citation  
     
    Bookmark   1 citation  
  24.  59
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   139 citations  
  25. 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  
  26.  81
    (1 other version)Computer Ethics.Deborah G. Johnson - 2003 - In Luciano Floridi, The Blackwell guide to the philosophy of computing and information. Blackwell. pp. 63–75.
    The prelims comprise: Introduction Metatheoretical and Methodological Issues Applied and Synthetic Ethics Traditional and Emerging Issues Conclusion Websites and Other Resources.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  27. Quantum computation in brain microtubules.Stuart R. Hameroff - 2002 - Physical Review E 65 (6):1869--1896.
    Proposals for quantum computation rely on superposed states implementing multiple computations simultaneously, in parallel, according to quantum linear superposition (e.g., Benioff, 1982; Feynman, 1986; Deutsch, 1985, Deutsch and Josza, 1992). In principle, quantum computation is capable of specific applications beyond the reach of classical computing (e.g., Shor, 1994). A number of technological systems aimed at realizing these proposals have been suggested and are being evaluated as possible substrates for quantum computers (e.g. trapped ions, electron spins, quantum dots, nuclear (...)
     
    Export citation  
     
    Bookmark   51 citations  
  28. Computation and content.Frances Egan - 1995 - Philosophical Review 104 (2):181-203.
  29.  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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  30.  20
    Computable limits and colimits in categories of partial enumerated sets.Andrzej Orlicki - 1993 - Mathematical Logic Quarterly 39 (1):181-196.
    Computable limits and colimits are “recursive counterparts” of the suitable classical concepts from category theory. We present mainly some interesting problems related to computable products. Moreover, some “computable counterparts” of well-known classical facts from category theory are given. MSC: 03D45, 18A30.
    Direct download  
     
    Export citation  
     
    Bookmark  
  31. (1 other version)Content, computation, and externalism.Christopher Peacocke - 1994 - Mind and Language 9 (3):227-264.
  32. 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 (...)
  33.  30
    Computation, Dynamics, and Cognition.Marco Giunti - 1997 - Oxford University Press.
    This book explores the application of dynamical theory to cognitive science. Giunti shows how the dynamical approach can illuminate problems of cognition, information processing, consciousness, meaning, and the relation between body and mind.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  34.  12
    , "Computers as modelers of climate," in the greatest inventions of the past.William Calvin - manuscript
    Computer simulations may allow us to understand the earth’s fickle climate and how it is affected by detours of the great ocean currents. These detours cause abrupt coolings -- the average global temperature can drop dramatically in just a few years, with droughts that set up El-Niño-like forest fires even in the tropics. While volcanic eruptions and Antarctic ice shelf collapses can also abruptly cool things, what we’re talking about here is a flip-flop: a few centuries later, there’s an equally (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  35. Computation as Involving Content: A Response to Egan.Christopher Peacocke - 1999 - Mind and Language 14 (2):195-202.
    Only computational explanations of a content‐involving sort can answer certain ‘how’‐questions; can support content‐involving counterfactuals; and have the generality characteristic of psychological explanations. Purely formal characteriza‐tions of computations have none of these properties, and do not determine content. These points apply not only to psychological explanation, but to Turing machines themselves. Computational explanations which involve content are not opposed to naturalism. They are also required if we are to explain the content‐involving properties of mental states.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  36.  85
    Limit computable integer parts.Paola D’Aquino, Julia Knight & Karen Lange - 2011 - Archive for Mathematical Logic 50 (7-8):681-695.
    Let R be a real closed field. An integer part I for R is a discretely ordered subring such that for every \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}rR{r \in R}\end{document}, there exists an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}iI{i \in I}\end{document} so that i ≤ r < i + 1. Mourgues and Ressayre (J Symb Logic 58:641–647, 1993) showed that every real closed field has an integer part. The procedure of Mourgues and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37. On implementing a computation.David J. Chalmers - 1994 - Minds and Machines 4 (4):391-402.
    To clarify the notion of computation and its role in cognitive science, we need an account of implementation, the nexus between abstract computations and physical systems. I provide such an account, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure of the computation. The account is developed for the class of combinatorial-state automata, but is sufficiently general to cover all other discrete computational formalisms. The (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   58 citations  
  38. What is computation?B. Jack Copeland - 1996 - Synthese 108 (3):335-59.
    To compute is to execute an algorithm. More precisely, to say that a device or organ computes is to say that there exists a modelling relationship of a certain kind between it and a formal specification of an algorithm and supporting architecture. The key issue is to delimit the phrase of a certain kind. I call this the problem of distinguishing between standard and nonstandard models of computation. The successful drawing of this distinction guards Turing's 1936 analysis of (...) against a difficulty that has persistently been raised against it, and undercuts various objections that have been made to the computational theory of mind. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   92 citations  
  39.  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  
  40. Languages, machines, and classical computation.Luis M. Augusto - 2019 - London, UK: College Publications.
    3rd ed, 2021. A circumscription of the classical theory of computation building up from the Chomsky hierarchy. With the usual topics in formal language and automata theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  41.  31
    Computational Philosophy of Science.Paul Thagard - 1988 - MIT Press.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   238 citations  
  42. 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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   668 citations  
  43. 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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  44.  32
    Uniformly computable aspects of inner functions: estimation and factorization.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (5):508-518.
    The theory of inner functions plays an important role in the study of bounded analytic functions. Inner functions are also useful in applied mathematics. Two foundational results in this theory are Frostman's Theorem and the Factorization Theorem. We prove a uniformly computable version of Frostman's Theorem. We then show that the Factorization Theorem is not uniformly computably true. We then show that for an inner function u with infinitely many zeros, the Blaschke sum of u provides the exact amount of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  45.  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 (...)
  46.  23
    Philosophy and Computer Science.Timothy Colburn - 2015 - Routledge.
    Colburn (computer science, U. of Minnesota-Duluth) has a doctorate in philosophy and an advanced degree in computer science; he's worked as a philosophy professor, a computer programmer, and a research scientist in artificial intelligence. Here he discusses the philosophical foundations of artificial intelligence; the new encounter of science and philosophy (logic, models of the mind and of reasoning, epistemology); and the philosophy of computer science (touching on math, abstraction, software, and ontology).
    Direct download  
     
    Export citation  
     
    Bookmark   31 citations  
  47.  23
    A computational mind cannot recognize itself.Jack McKay Fletcher - 2015 - Technoetic Arts 13 (3):261-267.
    The computational mind paradigm proposes that the mind is an information-processing system equivalent to a Turing machine. Some proponents of this view hope to emulate the mind using methods such as symbolism, connectionism or more biological models. In the present work, the following question is posed: is a computational mind capable of deciding (yes or no) whether a proposed emulation of the mind is indeed an emulation of the mind? It is argued that this is not possible. Intuitively, the reason (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48.  8
    Computation, Logic, Philosophy: A Collection of Essays.Wang Hao & Hao Wang - 1990 - Springer.
    ~Et moi,.... si j'avait su comment en revenir, One service mathematics has rendered the je n'y serais point alle.' human race. It has put common sense back Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non· The series is divergent; therefore we may be sense'. Eric T. Bell able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  49.  24
    Computer-Generated Images in Face Perception.Thomas Vetter & Mirella Walker - 2011 - In Andy Calder, Gillian Rhodes, Mark Johnson & Jim Haxby, Oxford Handbook of Face Perception. Oxford University Press. pp. 387.
    Research in the field of computer graphics and vision strives to precisely synthesize any possible human face in a way that it is perceived as a real face and to parametrically describe or analyze any existing human face. This article provides an overview of the theoretical and technical steps taken to get a model of human faces that satisfied two demands for face stimuli for experimental research: full control over the information in faces enabling precise manipulations on the one hand, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  50.  84
    Computational complexity analysis can help, but first we need a theory.Todd Wareham, Iris van Rooij & Moritz Müller - 2008 - Behavioral and Brain Sciences 31 (4):399-400.
    Leech et al. present a connectionist algorithm as a model of (the development) of analogizing, but they do not specify the algorithm's associated computational-level theory, nor its computational complexity. We argue that doing so may be essential for connectionist cognitive models to have full explanatory power and transparency, as well as for assessing their scalability to real-world input domains.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 970