Switch to: References

Add citations

You must login to add citations.
  1. The Abstraction/Representation Account of Computation and Subjective Experience.Jochen Szangolies - 2020 - Minds and Machines 30 (2):259-299.
    I examine the abstraction/representation theory of computation put forward by Horsman et al., connecting it to the broader notion of modeling, and in particular, model-based explanation, as considered by Rosen. I argue that the ‘representational entities’ it depends on cannot themselves be computational, and that, in particular, their representational capacities cannot be realized by computational means, and must remain explanatorily opaque to them. I then propose that representation might be realized by subjective experience, through being the bearer of the structure (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Sobre el anti-realismo de Wittgenstein y su aplicación al programa chomskiano.Sergio Mota - 2014 - Metatheoria – Revista de Filosofía E Historia de la Ciencia 4:35--51.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Alan Turing and the Mathematical Objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
    This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  • On the Person-Based Predictive Policing of AI.Tzu-Wei Hung & Chun-Ping Yen - forthcoming - Ethics and Information Technology.
    Should you be targeted by police for a crime that AI predicts you will commit? In this paper, we analyse when, and to what extent, the person-based predictive policing (PP) — using AI technology to identify and handle individuals who are likely to breach the law — could be justifiably employed. We first examine PP’s epistemological limits, and then argue that these defects by no means refrain from its usage; they are worse in humans. Next, based on major AI ethics (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • La historia y la gramática de la recursión: una precisión desde la obra de Wittgenstein.Sergio Mota - 2014 - Pensamiento y Cultura 17 (1):20-48.
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • Thinking May Be More Than Computing.Peter Kugel - 1986 - Cognition 22 (2):137-198.
  • Enciclopédia de Termos Lógico-Filosóficos.João Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.
    Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   5 citations  
  • The Mathematical Work of S. C. Kleene.J. R. Shoenfield & S. C. Kleene - 1995 - Bulletin of Symbolic Logic 1 (1):8-43.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
    We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   39 citations  
  • Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
    We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Effective Choice and Boundedness Principles in Computable Analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.
    In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Some Natural Decision Problems in Automatic Graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
    For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler path, bounding the number of ends, and bounding the number of infinite branches in a tree (C) existence of an infinite clique and an infinite version of set cover The complexity of these problems is determined for automatic graphs and, supplementing results from the literature, for recursive graphs. Our results show (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • ¿Qué Es Un Algoritmo? Una Respuesta Desde la Obra de Wittgenstein.Sergio Mota - 2015 - Endoxa 36:317.
    No categories
    Direct download (5 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Diagonalisation and Church's Thesis: Kleene's Homework.Enrique Alonso & Maria Manzano - 2005 - History and Philosophy of Logic 26 (2):93-113.
    In this paper we will discuss the active part played by certain diagonal arguments in the genesis of computability theory. 1?In some cases it is enough to assume the enumerability of Y while in others the effective enumerability is a substantial demand. These enigmatical words by Kleene were our point of departure: When Church proposed this thesis, I sat down to disprove it by diagonalizing out of the class of the ??definable functions. But, quickly realizing that the diagonalization cannot be (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Emil Post.Alasdair Urquhart - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--617.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Index Sets Related to Prompt Simplicity.Steven Schwarz - 1989 - Annals of Pure and Applied Logic 42 (3):243-254.
  • Effective Topological Spaces I: A Definability Theory.Iraj Kalantari & Galen Weitkamp - 1982 - Annals of Pure and Applied Logic 29 (1):1-27.
  • Effective Topological Spaces II: A Hierarchy.Iraj Kalantari & Galen Weitkamp - 1982 - Annals of Pure and Applied Logic 29 (2):207-224.
    This paper is an investigation of definability hierarchies on effective topological spaces. An open subset U of an effective space X is definable iff there is a parameter free definition φ of U so that the atomic predicate symbols of φ are recursively open relations on X . The complexity of a definable open set may be identified with the quantifier complexity of its definition. For example, a set U is an ∃∃∀∃-set if it has an ∃∃∀∃ parameter free definition (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine.Tom F. Sterkenburg - unknown
    The diagonalization argument of Putnam denies the possibility of a universal learning machine. Yet the proposal of Solomonoff and Levin promises precisely such a thing. In this paper I discuss how their proposed measure function manages to evade Putnam's diagonalization in one respect, only to fatally fall prey to it in another.
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  • Effective Topological Spaces III: Forcing and Definability.Iraj Kalantari & Galen Weitkamp - 1987 - Annals of Pure and Applied Logic 36 (1):17-27.
  • Tarski's Theory of Definability: Common Themes in Descriptive Set Theory, Recursive Function Theory, Classical Pure Logic, and Finite-Universe Logic.J. W. Addison - 2004 - Annals of Pure and Applied Logic 126 (1-3):77-92.
    Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We review (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Levy and Set Theory.Akihiro Kanamori - 2006 - Annals of Pure and Applied Logic 140 (1):233-252.
    Azriel Levy did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcing and definability will continue to be basic to the subject. What follows is a detailed account and analysis of Levy’s work and contributions (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Proof-Theoretic Conservations of Weak Weak Intuitionistic Constructive Set Theories.Lev Gordeev - 2013 - Annals of Pure and Applied Logic 164 (12):1274-1292.
    The paper aims to provide precise proof theoretic characterizations of Myhill–Friedman-style “weak” constructive extensional set theories and Aczel–Rathjen analogous constructive set theories both enriched by Mostowski-style collapsing axioms and/or related anti-foundation axioms. The main results include full intuitionistic conservations over the corresponding purely arithmetical formalisms that are well known in the reverse mathematics – which strengthens analogous results obtained by the author in the 80s. The present research was inspired by the more recent Sato-style “weak weak” classical extensional set theories (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Turing Machines.David Barker-Plummer - 2008 - Stanford Encyclopedia of Philosophy.