Contents
29 found
Order:
  1. 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. 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  
  3. 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  
  4. Học liệu BMF analytics hiện diện tại Harvard University HOLLIS.Tổ Kỹ Thuật Aisdl - 2024 - Bmf Method.
    Cuốn tài liệu học thuật trình bày phương pháp “BMF analytics” hiện đã bước sang năm thứ ba phục vụ cộng đồng nghiên cứu. Cuốn sách đã góp phần hỗ trợ nhiều nhà nghiên cứu trẻ triển khai và hoàn thành công việc.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Two-level grammars: Some interesting properties of van Wijngaarden grammars.Luis M. Augusto - 2023 - Omega - Journal of Formal Languages 1:3-34.
    The van Wijngaarden grammars are two-level grammars that present many interesting properties. In the present article I elaborate on six of these properties, to wit, (i) their being constituted by two grammars, (ii) their ability to generate (possibly infinitely many) strict languages and their own metalanguage, (iii) their context-sensitivity, (iv) their high descriptive power, (v) their productivity, or the ability to generate an infinite number of production rules, and (vi) their equivalence with the unrestricted, or Type-0, Chomsky grammars.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Computational logic. Vol. 1: Classical deductive computing with classical logic. 2nd ed.Luis M. Augusto - 2022 - London: College Publications.
    This is the 3rd edition. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing – a.k.a. formal languages and automata theory – and classical deduction with the classical first-order predicate calculus with (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Self-referential theories.Samuel A. Alexander - 2020 - Journal of Symbolic Logic 85 (4):1687-1716.
    We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. 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 4TH Edición. 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  
     
    Export citation  
     
    Bookmark  
  9. Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm.Marco Cococcioni, Massimo Pappalardo & Yaroslav Sergeyev - 2018 - Applied Mathematics and Computation 318:298-311.
    Numerous problems arising in engineering applications can have several objectives to be satisfied. An important class of problems of this kind is lexicographic multi-objective problems where the first objective is incomparably more important than the second one which, in its turn, is incomparably more important than the third one, etc. In this paper, Lexicographic Multi-Objective Linear Programming (LMOLP) problems are considered. To tackle them, traditional approaches either require solution of a series of linear programming problems or apply a scalarization of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  10. Consistency proof of a fragment of pv with substitution in bounded arithmetic.Yoriyuki Yamagata - 2018 - Journal of Symbolic Logic 83 (3):1063-1090.
    This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and either (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. 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 Organism and Intelligent Machines. Heidelberg: 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  
  12. 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  
  13. Simple or Complex Bodies? Trade-offs in Exploiting Body Morphology for Control.Vincent Müller & Matej Hoffmann - 2017 - In Gordana Dodig-Crnkovic & Raffaela Giovagnoli (eds.), Representation of Reality: Humans, Other Living Organism and Intelligent Machines. Heidelberg: 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 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 propose the dynamical systems framework as the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. Socio-technical computation.Markus Luczak-Roesch, Ramine Tinati, Kieron O'Hara & Nigel Shadbolt - 2015 - In Markus Luczak-Roesch, Ramine Tinati, Kieron O'Hara & Nigel Shadbolt (eds.), 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  
  15. Info-computational Constructivism and Cognition.G. Dodig-Crnkovic - 2014 - Constructivist Foundations 9 (2):223-231.
    Context: At present, we lack a common understanding of both the process of cognition in living organisms and the construction of knowledge in embodied, embedded cognizing agents in general, including future artifactual cognitive agents under development, such as cognitive robots and softbots. Purpose: This paper aims to show how the info-computational approach (IC) can reinforce constructivist ideas about the nature of cognition and knowledge and, conversely, how constructivist insights (such as that the process of cognition is the process of life) (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  16. Trade-offs in exploiting body morphology for control: From simple bodies and model-based control to complex ones with model-free distributed control schemes.Matej Hoffmann & Vincent C. Müller - 2014 - In Helmut Hauser, Rudolf M. Füchslin & Rolf Pfeifer (eds.), Opinions and Outlooks on Morphological Computation. E-Book. pp. 185-194.
    Tailoring the design of robot bodies for control purposes is implicitly performed by engineers, however, a methodology or set of tools is largely absent and optimization of morphology (shape, material properties of robot bodies, etc.) is lag- ging 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 "mor- phological computation" in the sense of offloading computation (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  17. 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  
  18. 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  
  19. 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  
     
    Export citation  
     
    Bookmark  
  20. Intractability and the use of heuristics in psychological explanations.Iris van 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   14 citations  
  21. 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  
     
    Export citation  
     
    Bookmark   5 citations  
  22. Numerical computations and mathematical modelling with infinite and infinitesimal numbers.Yaroslav Sergeyev - 2009 - Journal of Applied Mathematics and Computing 29:177-195.
    Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not related to the non-standard analysis) is used to work with finite, infinite, and infinitesimal numbers numerically. This can be done on a new kind of a computer – the Infinity Computer – able to work with all these types of numbers. The new computational tools both give possibilities to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  23. 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  
  24. Strong normalization of a symmetric lambda calculus for second-order classical logic.Yoriyuki Yamagata - 2002 - Archive for Mathematical Logic 41 (1):91-99.
    We extend Barbanera and Berardi's symmetric lambda calculus [2] to second-order classical propositional logic and prove its strong normalization.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  25. P≠NP, By accepting to make a shift in the Theory (Time as a fuzzy concept) The Structure of a Theory (TC*, Theory of Computation based on Fuzzy time).Farzad Didehvar - manuscript
    In a series of articles we try to show the need of a novel Theory for Theory of Computation based on considering time as a Fuzzy concept. Time is a central concept In Physics. First we were forced to consider some changes and modifications in the Theories of Physics. In the second step and throughout this article we show the positive Impact of this modification on Theory of Computation and Complexity Theory to rebuild it in a more successful and fruitful (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  26. (TC* ،زمان فازی ) تاثیر و تاثر منطق و پارادوکسها بر نظریه محاسبات عام. [REVIEW]Didehvar Farzad - manuscript
    در تکوین نظریه محاسبات از اوایل قرن بیستم پارادکسها و خود ارجاعی نقش ویژه ای را بازی کرده اند. هر چند نظریه محاسبات عام بر اساس تعریف ماشین تورینگ، فرض تورینگ_چرچ و کاربردهای آن بنا شده ،اما از همان ابتدا تا به امروز منطق و حوزه های مختلف این علم در ارتباط تنگاتنگ با این تیوری و در ابتدا نظریه محاسبات خاص بوده و این ارتباط روز به روز گسترده و گسترده تر گشته است. از تاثیر پارادوکس دروغگو و پارادکس (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. (2 other versions)Theory of Fuzzy Time Computation (3).Didehvar Farzad - manuscript
    Here, we give the second proof for TC+CON(TC∗)ͰP≠NP . The first proof is in [1]. In the second proof, we do not employ the concept of scope.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  28. 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  
     
    Export citation  
     
    Bookmark  
  29. Defining a Decidability Decider for the Halting Problem.P. 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