Results for 'Computing'

968 found
Order:
See also
  1. 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  
  2.  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  
  3. 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  
  4. 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.
  5.  10
    A Model for Proustian Decay.Computer Lars - 2024 - Nordic Journal of Aesthetics 33 (67).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  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  
  7. 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  
  8. 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  
  9.  45
    Computational Artifacts: Towards a Philosophy of Computer Science.Raymond Turner - 2018 - Springer Berlin Heidelberg.
    The philosophy of computer science is concerned with issues that arise from reflection upon the nature and practice of the discipline of computer science. This book presents an approach to the subject that is centered upon the notion of computational artefact. It provides an analysis of the things of computer science as technical artefacts. Seeing them in this way enables the application of the analytical tools and concepts from the philosophy of technology to the technical artefacts of computer science. With (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  10.  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  
  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. 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  
  13. 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  
  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.  35
    Computing is at best a special kind of thinking.James H. Fetzer - 2000 - In The Proceedings of the Twentieth World Congress of Philosophy, Volume 9: Philosophy of Mind. Charlottesville: Philosophy Doc Ctr. pp. 103-113.
    When computing is defined as the causal implementation of algorithms and algorithms are defined as effective decision procedures, human thought is mental computation only if it is governed by mental algorithms. An examination of ordinary thinking, however, suggests that most human thought processes are non-algorithmic. Digital machines, moreover, are mark-manipulating or string-processing systems whose marks or strings do not stand for anything for those systems, while minds are semiotic (or “signusing”) systems for which signs stand for other things for (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. 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  
  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. Computation and intentionality: A recipe for epistemic impasse.Itay Shani - 2005 - Minds and Machines 15 (2):207-228.
    Searle’s celebrated Chinese room thought experiment was devised as an attempted refutation of the view that appropriately programmed digital computers literally are the possessors of genuine mental states. A standard reply to Searle, known as the “robot reply” (which, I argue, reflects the dominant approach to the problem of content in contemporary philosophy of mind), consists of the claim that the problem he raises can be solved by supplementing the computational device with some “appropriate” environmental hookups. I argue that not (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Computability: Gödel, Turing, Church, and beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - 2013 - MIT Press.
  20.  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  
  21.  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  
  22. 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  
  23.  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  
  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 vs. analog, serial (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   139 citations  
  25. Computing the Extended Synthesis: Mapping the Dynamics and Conceptual Structure of the Evolvability Research Front.Laura Nuño de la Rosa - 2017 - Journal of Experimental Zoology Part B: Molecular and Developmental Evolution 328 (5):395–411.
    Since the late 1970s, the field of evolutionary biology has undergone empirical and theoretical developments that have threaten the pillars of evolutionary theory. Some evolutionary biologists have recently argued that evolutionary biology is not experiencing a paradigm shift, but an expansion of the modern synthesis. Philosophers of biology focusing on scientific practices seem to agree with this pluralistic interpretation and have argued that evolutionary theory should rather be seen as an organized network of multiple problem agendas with diverse disciplinary contributors. (...)
    No categories
     
    Export citation  
     
    Bookmark  
  26.  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  
  27. 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  
  28. 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  
  29. Computation, Information, Cognition: The Nexus and the Liminal.f.Gordana Dodig Crnkovic & Susan Stuart (eds.) - 2007 - Cambridge Scholars Press.
    Written by world-leading experts, this book draws together a number of important strands in contemporary approaches to the philosophical and scientific questions that emerge when dealing with the issues of computing, information, cognition and the conceptual issues that arise at their intersections. It discovers and develops the connections at the borders and in the interstices of disciplines and debates. This volume presents a range of essays that deal with the currently vigorous concerns of the philosophy of information, ontology creation (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. 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  
  31.  14
    On Computability Theoretic Properties of Structures and Their Cartesian Products.Bakhadyr Khoussainov - 2000 - Mathematical Logic Quarterly 46 (4):467-476.
    In this paper we show that for any set X ⊆ ω there exists a structure [MATHEMATICAL SCRIPT CAPITAL A] that has no presentation computable in X such that [MATHEMATICAL SCRIPT CAPITAL A]2 has a computable presentation. We also show that there exists a structure [MATHEMATICAL SCRIPT CAPITAL A] with infinitely many computable isomorphism types such that [MATHEMATICAL SCRIPT CAPITAL A]2 has exactly one computable isomorphism type.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  59
    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  
  33. 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  
  34. (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  
  35. 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  
  36.  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  
  37.  57
    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  
  38. (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   1146 citations  
  39.  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 (...)
  40. 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  
  41.  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  
  42.  76
    Computational Dialectic and Rhetorical Invention.Douglas Walton - 2011 - AI and Society 26 (1):2011.
    This paper has three dimensions, historical, theoretical and social. The historical dimension is to show how the Ciceronian system of dialectical argumentation served as a precursor to computational models of argumentation schemes such as Araucaria and Carneades. The theoretical dimension is to show concretely how these argumentation schemes reveal the interdependency of rhetoric and logic, and so the interdependency of the normative with the empirical. It does this by identifying points of disagreement in a dialectical format through using argumentation schemes (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  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.  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. Cognition, Computing and Dynamic Systems.Mario Villalobos & Joe Dewhurst - 2016 - Límite. Revista Interdisciplinaria de Filosofía y Psicología 1.
    Traditionally, computational theory (CT) and dynamical systems theory (DST) have presented themselves as opposed and incompatible paradigms in cognitive science. There have been some efforts to reconcile these paradigms, mainly, by assimilating DST to CT at the expenses of its anti-representationalist commitments. In this paper, building on Piccinini’s mechanistic account of computation and the notion of functional closure, we explore an alternative conciliatory strategy. We try to assimilate CT to DST by dropping its representationalist commitments, and by inviting CT to (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  15
    A Computational Logic for Applicative Common LISP.Matt Kaufmann & J. Strother Moore - 2002 - In Dale Jacquette, A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 724–741.
    This chapter contains sections titled: Introduction The ACL2 System A Modeling Problem Case Studies.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  47. What Computers Still Can’T Do: A Critique of Artificial Reason.Hubert L. Dreyfus - 1992 - MIT Press.
    A Critique of Artificial Reason Hubert L. Dreyfus . HUBERT L. DREYFUS What Computers Still Can't Do Thi s One XZKQ-GSY-8KDG What. WHAT COMPUTERS STILL CAN'T DO Front Cover.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   296 citations  
  48. A Computable Universe: Understanding and Exploring Nature as Computation.Hector Zenil - unknown
    A Computable Universe is a collection of papers discussing computation in nature and the nature of computation, a compilation of the views of the pioneers in the contemporary area of intellectual inquiry focused on computational and informational theories of the world. This volume is the definitive source of informational/computational views of the world, and of cutting-edge models of the universe, both digital and quantum, discussed from a philosophical perspective as well as in the greatest technical detail. The book discusses the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  49. 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  
  50. Hacking the brain: brain–computer interfacing technology and the ethics of neurosecurity.Marcello Ienca & Pim Haselager - 2016 - Ethics and Information Technology 18 (2):117-129.
    Brain–computer interfacing technologies are used as assistive technologies for patients as well as healthy subjects to control devices solely by brain activity. Yet the risks associated with the misuse of these technologies remain largely unexplored. Recent findings have shown that BCIs are potentially vulnerable to cybercriminality. This opens the prospect of “neurocrime”: extending the range of computer-crime to neural devices. This paper explores a type of neurocrime that we call brain-hacking as it aims at the illicit access to and manipulation (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   25 citations  
1 — 50 / 968