View topic on PhilPapers for more information
Related categories

17 found
Order:
More results on PhilPapers
  1. added 2020-05-16
    By Considering Fuzzy Time, P=BPP (P*=BPP*).Farzad Didehvar - manuscript
    The reason ability of considering time as a fuzzy concept is demonstrated in [7],[8]. One of the major questions which arise here is the new definitions of Complexity Classes. In [1],[2],…,[11] we show why we should consider time a fuzzy concept. It is noticeable to mention that that there were many attempts to consider time as a Fuzzy concept, in Philosophy, Mathematics and later in Physics but mostly based on the personal intuition of the authors or as a style of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. added 2019-12-06
    Reseña de ' Los Límites Exteriores de la Razón '(The Outer Limits of Reason) por Noson Yanofsky 403p (2013) (revision revisada 2019).Michael Richard Starks - 2019 - In Delirios Utópicos Suicidas en el Siglo 21 La filosofía, la naturaleza humana y el colapso de la civilización Artículos y reseñas 2006-2019 4a Edición. Las Vegas, NV USA: Reality Press. pp. 283-298.
    Doy una revisión detallada de ' los límites externos de la razón ' por Noson Yanofsky desde una perspectiva unificada de Wittgenstein y la psicología evolutiva. Yo indiqué que la dificultad con cuestiones como la paradoja en el lenguaje y las matemáticas, la incompletitud, la indeterminación, la computabilidad, el cerebro y el universo como ordenadores, etc., surgen de la falta de mirada cuidadosa a nuestro uso del lenguaje en el adecuado contexto y, por tanto, el Error al separar los problemas (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. added 2018-07-31
    The Social in the Platform Trap: Why a Microscopic System Focus Limits the Prospect of Social Machines.Markus Luczak-Roesch & Ramine Tinati - 2017 - Discover Society 40.
    “Filter bubble”, “echo chambers”, “information diet” – the metaphors to describe today’s information dynamics on social media platforms are fairly diverse. People use them to describe the impact of the viral spread of fake, biased or purposeless content online, as witnessed during the recent race for the US presidency or the latest outbreak of the Ebola virus (in the latter case a tasteless racist meme was drowning out any meaningful content). This unravels the potential envisioned to arise from emergent activities (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. added 2018-07-31
    Socio-Technical Computation.Markus Luczak-Roesch, Ramine Tinati, Kieron O'Hara & Nigel Shadbolt - 2015 - In Proceedings of the 18th ACM Conference Companion on Computer Supported Cooperative Work & Social Computing.
    Motivated by the significant amount of successful collaborative problem solving activity on the Web, we ask: Can the accumulated information propagation behavior on the Web be conceived as a giant machine, and reasoned about accordingly? In this paper we elaborate a thesis about the computational capability embodied in information sharing activities that happen on the Web, which we term socio-technical computation, reflecting not only explicitly conditional activities but also the organic potential residing in information on the Web.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. added 2018-06-18
    Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic.Luis M. Augusto - 2018 - London: College Publications.
    This is the first of a two-volume work combining two fundamental components of contemporary computing into classical deductive computing, a powerful form of computation, highly adequate for programming and automated theorem proving, which, in turn, have fundamental applications in areas of high complexity and/or high security such as mathematical proof, software specification and verification, and expert systems. Deductive computation is concerned with truth-preservation: This is the essence of the satisfiability problem, or SAT, the central computational problem in computability and complexity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. added 2018-02-21
    Defining a Decidability Decider for the Halting Problem.Pete Olcott - manuscript
    When we understand that every potential halt decider must derive a formal mathematical proof from its inputs to its final states previously undiscovered semantic details emerge. -/- When-so-ever the potential halt decider cannot derive a formal proof from its input strings to its final states of Halts or Loops, undecidability has been decided. -/- The formal proof involves tracing the sequence of state transitions of the input TMD as syntactic logical consequence inference steps in the formal language of Turing Machine (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. added 2018-01-26
    Simple or Complex Bodies? Trade-Offs in Exploiting Body Morphology for Control.Matej Hoffmann & Vincent C. Müller - 2017 - In Gordana Dodig-Crnkovic & Raffaela Giovagnoli (eds.), Representation of Reality: Humans, Other Living Organisms and Intelligent Machines. Berlin: Springer. pp. 335-345.
    Engineers fine-tune the design of robot bodies for control purposes, however, a methodology or set of tools is largely absent, and optimization of morphology (shape, material properties of robot bodies, etc.) is lagging behind the development of controllers. This has become even more prominent with the advent of compliant, deformable or ”soft” bodies. These carry substantial potential regarding their exploitation for control—sometimes referred to as ”morphological computation”. In this article, we briefly review different notions of computation by physical systems and (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. added 2017-07-30
    Intractability and the Use of Heuristics in Psychological Explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.
    Many cognitive scientists, having discovered that some computational-level characterization f of a cognitive capacity φ is intractable, invoke heuristics as algorithmic-level explanations of how cognizers compute f. We argue that such explanations are actually dysfunctional, and rebut five possible objections. We then propose computational-level theory revision as a principled and workable alternative.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  9. added 2017-03-13
    From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations.Mark Burgin & Gordana Dodig-Crnkovic - 2013 - In Gordana Dodig-Crnkovic Raffaela Giovagnoli (ed.), Computing Nature. pp. 241--253.
    In this paper we analyze methodological and philosophical implications of algorithmic aspects of unconventional computation. At first, we describe how the classical algorithmic universe developed and analyze why it became closed in the conventional approach to computation. Then we explain how new models of algorithms turned the classical closed algorithmic universe into the open world of algorithmic constellations, allowing higher flexibility and expressive power, supporting constructivism and creativity in mathematical modeling. As Goedels undecidability theorems demonstrate, the closed algorithmic universe restricts (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. added 2017-01-09
    A Theory Explains Deep Learning.Kenneth Kijun Lee & Chase Kihwan Lee - manuscript
    This is our journal for developing Deduction Theory and studying Deep Learning and Artificial intelligence. Deduction Theory is a Theory of Deducing World’s Relativity by Information Coupling and Asymmetry. We focus on information processing, see intelligence as an information structure that relatively close object-oriented, probability-oriented, unsupervised learning, relativity information processing and massive automated information processing. We see deep learning and machine learning as an attempt to make all types of information processing relatively close to probability information processing. We will discuss (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. added 2016-08-28
    What a Course on Philosophy of Computing is Not.Vincent C. Müller - 2008 - APA Newsletter on Philosophy and Computers 8 (1):36-38.
    Immanuel Kant famously defined philosophy to be about three questions: “What can I know? What should I do? What can I hope for?” (KrV, B833). I want to suggest that the three questions of our course on the philosophy of computing are: What is computing? What should we do with computing? What could computing do?
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. added 2015-09-29
    A Contradiction and P=NP Problem.Farzad Didehvar - manuscript
    Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. added 2015-09-05
    Strong Normalization of a Symmetric Lambda Calculus for Second-Order Classical Logic.Yoriyuki Yamagata - 2002 - Archive for Mathematical Logic 41 (1):91-99.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. added 2014-07-08
    Aspectos psico-bio-socio-culturales del lenguaje natural humano.Dante Roberto Salatino (ed.) - 2012 - Desktop Publishing Amazon.
    Este estudio del lenguaje natural, realizado desde la observación, permite analizar los aspectos subjetivos que le dan origen al lenguaje, y que posibilitan su adquisición y comprensión. Como tal constituye la primera teoría realmente original aparecida en los últimos 55 años, luego que Chomsky nos hiciera conocer su gramática generativa (1957), con la diferencia que, en este caso, tiene el soporte de una lógica también original, la Lógica Transcursiva. Esta lógica se basa en una modificación de la lógica policontextural de (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  15. added 2013-12-09
    Single-Tape and Multi-Tape Turing Machines Through the Lens of the Grossone Methodology.Yaroslav Sergeyev & Alfredo Garro - 2013 - Journal of Supercomputing 65 (2):645-663.
    The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the instrument (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. added 2013-12-09
    Higher Order Numerical Differentiation on the Infinity Computer.Yaroslav Sergeyev - 2011 - Optimization Letters 5 (4):575-585.
    There exist many applications where it is necessary to approximate numerically derivatives of a function which is given by a computer procedure. In particular, all the fields of optimization have a special interest in such a kind of information. In this paper, a new way to do this is presented for a new kind of a computer - the Infinity Computer - able to work numerically with finite, infinite, and infinitesimal number. It is proved that the Infinity Computer is able (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  17. added 2013-03-06
    A Turing Machine for Exponential Function.P. M. F. Lemos - manuscript
    This is a Turing Machine which computes the exponential function f(x,y) = xˆy. Instructions format and operation of this machine are intended to best reflect the basic conditions outlined by Alan Turing in his On Computable Numbers, with an Application to the Entscheidungsproblem (1936), using the simplest single-tape and single-symbol version, in essence due to Kleene (1952) and Carnielli & Epstein (2008). This machine is composed by four basic task machines: one which checks if exponent y is zero, a second (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark