Results for 'Computation Tree Logic'

1000+ found
Order:
  1.  56
    Computation Tree Logics and Temporal Logics with Reference Pointers.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  2. Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  3. Cognitive Computation Sans Representation.Paul Schweizer - 2017 - In Thomas Powers (ed.), Philosophy and Computing: Essays in epistemology, philosophy of mind, logic, and ethics,. Cham, Switzerland: 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  4. Sets, Logic, Computation. An Open Introduction to Metalogic.Richard Zach - 2017
    An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.
    Download  
     
    Export citation  
     
    Bookmark  
  5. Sense and the Computation of Reference.Reinhard Muskens - 2004 - Linguistics and Philosophy 28 (4):473 - 504.
    The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  6. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  8. Second-Order Logic.John Corcoran - 2001 - In M. Zeleny (ed.), Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. KLUKER. pp. 61–76.
    “Second-order Logic” in Anderson, C.A. and Zeleny, M., Eds. Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Dordrecht: Kluwer, 2001. Pp. 61–76. -/- Abstract. This expository article focuses on the fundamental differences between second- order logic and first-order logic. It is written entirely in ordinary English without logical symbols. It employs second-order propositions and second-order reasoning in a natural way to illustrate the fact that second-order logic is actually a familiar part of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  9.  37
    沃尔珀特、柴廷和维特根斯坦关于不可能、不完整、说谎的悖论、有论、计算极限、非量子力学不确定性原理和宇宙作为计算机——图灵机器理论的终极定理 (Wolpert, Chaitin and Wittgenstein on Impossibility, Incompleteness, the Liar Paradox, Theism, the Limits of Computation, a Non-Quantum Mechanical Uncertainty Principle and the Universe as Computer—the Ultimate Theorem in T Machine Theory) (修订 2019).Michael Richard Starks - 2020 - In 欢迎来到地球上的地狱: 婴儿,气候变化,比特币,卡特尔,中国,民主,多样性,养成基因,平等,黑客,人权,伊斯兰教,自由主义,繁荣,网络,混乱。饥饿,疾病,暴力,人工智能,战争. Las Vegas, NV USA: Reality Press. pp. 173-177.
    我最近读过许多关于计算极限和宇宙作为计算机的讨论,希望找到一些关于多面体物理学家和决策理论家大卫·沃尔珀特的惊人工作的评论,但没有发现一个引文,所以我提出这个非常简短的总结。Wolpert 证明了一些惊人的不可能或不完整的定理(1992-2008-见arxiv dot org)对推理(计算)的限制,这些极限非常一般,它们独立于执行计算的设备,甚至独立于物理定律,因此,它们适用于计算机、物理和人类行为。他们利用Cantor的对角线、骗子悖论和世界线来提供图灵机器理论的 终极定理,并似乎提供了对不可能、不完整、计算极限和宇宙的见解。计算机,在所有可能的宇宙和所有生物或机制,产生,除其他外,非量子力学不确定性原理和一神论的证明。与柴廷、所罗门诺夫、科莫尔加罗夫和维特根斯 坦的经典作品以及任何程序(因此没有设备)能够生成比它拥有的更大复杂性的序列(或设备)的概念有着明显的联系。有人可能会说,这一工作意味着无政府主义,因为没有比物质宇宙更复杂的实体,从维特根斯坦的观点来看 ,"更复杂的"是毫无意义的(没有满足的条件,即真理制造者或测试)。即使是"上帝"(即具有无限时间/空间和能量的"设备")也无法确定给定的&q uot;数字"是否为"随机",也无法找到某种方式来显示给定的"公式"、"定理"或"句子"或"设备&q uot;(所有这些语言都是复杂的语言)游戏)是特定"系统"的一部分。 那些希望从现代两个系统的观点来看为人类行为建立一个全面的最新框架的人,可以查阅我的书《路德维希的哲学、心理学、Mind 和语言的逻辑结构》维特根斯坦和约翰·西尔的《第二部》(2019年)。那些对我更多的作品感兴趣的人可能会看到《会说话的猴子——一个末日星球上的哲学、心理学、科学、宗教和政治——文章和评论2006-201 9年第二次(2019年)》和《自杀乌托邦幻想》第21篇世纪4日 (2019).
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  10. On an Intuitionistic Logic for Pragmatics.Gianluigi Bellin, Massimiliano Carrara & Daniele Chiffi - 2018 - Journal of Logic and Computation 50 (28):935–966..
    We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justi cations and its relations with classical logic. We recall an extension of this approach to a logic dealing with assertions and obligations, related by a notion of causal implication [14, 45]. We focus on the extension to co-intuitionistic logic, seen as a logic of hypotheses [8, 9, 13] and on polarized bi-intuitionistic logic as a (...) of assertions and conjectures: looking at the S4 modal translation, we give a de nition of a system AHL of bi-intuitionistic logic that correctly represents the duality between intuitionistic and co-intuitionistic logic, correcting a mistake in previous work [7, 10]. A computational interpretation of cointuitionism as a distributed calculus of coroutines is then used to give an operational interpretation of subtraction.Work on linear co-intuitionism is then recalled, a linear calculus of co-intuitionistic coroutines is de ned and a probabilistic interpretation of linear co-intuitionism is given as in [9]. Also we remark that by extending the language of intuitionistic logic we can express the notion of expectation, an assertion that in all situations the truth of p is possible and that in a logic of expectations the law of double negation holds. Similarly, extending co-intuitionistic logic, we can express the notion of conjecture that p, de ned as a hypothesis that in some situation the truth of p is epistemically necessary. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  11.  17
    असंभव, अपूर्णता, अपूर्णता, झूठा विरोधाभास, सिद्धांतवाद, गणना की सीमा, एक गैर-क्वांटम यांत्रिक अनिश्चितता सिद्धांत और कंप्यूटर के रूप में ब्रह्मांड पर Wolpert, Chaitin और Wittgenstein ट्यूरिंग मशीन थ्योरी में अंतिम प्रमेय --Wolpert, Chaitin and Wittgenstein on impossibility, incompleteness, the liar paradox, theism, the limits of computation, a non-quantum mechanical uncertainty principle and the universe as computer—the ultimate theorem in Turing Machine Theory (संशोधित 2019).Michael Richard Starks - 2020 - In पृथ्वी पर नर्क में आपका स्वागत है: शिशुओं, जलवायु परिवर्तन, बिटकॉइन, कार्टेल, चीन, लोकतंत्र, विविधता, समानता, हैकर्स, मानव अधिकार, इस्लाम, उदारवाद, समृद्धि, वेब, अराजकता, भुखमरी, बीमारी, हिंसा, कृत्रिम बुद्धिमत्ता, युद्ध. Las Vegas, NV, USA: Reality Press. pp. 215-220.
    मैं कंप्यूटर के रूप में गणना और ब्रह्मांड की सीमा के कई हाल ही में चर्चा पढ़ लिया है, polymath भौतिक विज्ञानी और निर्णय सिद्धांतकार डेविड Wolpert के अद्भुत काम पर कुछ टिप्पणी खोजने की उम्मीद है, लेकिन एक भी प्रशस्ति पत्र नहीं मिला है और इसलिए मैं यह बहुत संक्षिप्त मौजूद सारांश. Wolpert कुछ आश्चर्यजनक असंभव या अधूरापन प्रमेयों साबित कर दिया (1992 से 2008-देखें arxiv dot org) अनुमान के लिए सीमा पर (कम्प्यूटेशन) कि इतने सामान्य वे गणना कर (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12.  94
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13.  96
    The Logic of the Method of Agent-Based Simulation in the Social Sciences: Empirical and Intentional Adequacy of Computer Programs.Nuno David, Jaime Sichman & Helder Coleho - 2005 - Journal of Artificial Societies and Social Simulation 8 (4).
    The classical theory of computation does not represent an adequate model of reality for simulation in the social sciences. The aim of this paper is to construct a methodological perspective that is able to conciliate the formal and empirical logic of program verification in computer science, with the interpretative and multiparadigmatic logic of the social sciences. We attempt to evaluate whether social simulation implies an additional perspective about the way one can understand the concepts of program and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  14. Enriching Deontic Logic.Ilaria Canavotto & Alessandro Giordani - 2018 - Journal of Logic and Computation 1:1-23.
    It is well known that systems of action deontic logic emerging from a standard analysis of permission in terms of possibility of doing an action without incurring in a violation of the law are subject to paradoxes. In general, paradoxes are acknowledged as such if we have intuitions telling us that things should be different. The aim of this paper is to introduce a paradox-free deontic action system by (i) identifying the basic intuitions leading to the emergence of the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  67
    Algorithmic Correspondence and Completeness in Modal Logic. V. Recursive Extensions of SQEMA.Willem Conradie, Valentin Goranko & Dimitar Vakarelov - 2010 - Journal of Applied Logic 8 (4):319-333.
    The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  16. Modal Logic S4 as a Paraconsistent Logic with a Topological Semantics.Marcelo E. Coniglio & Leonardo Prieto-Sanabria - 2017 - In Carlos Caleiro, Francisco Dionisio, Paula Gouveia, Paulo Mateus & João Rasga (eds.), Logic and Computation: Essays in Honour of Amilcar Sernadas. London, UK: College Publications. pp. 171-196.
    In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a nice topological (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. Proofs Are Programs: 19th Century Logic and 21st Century Computing.Philip Wadler - manuscript
    As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18. Two-Sided Trees for Sentential Logic, Predicate Logic, and Sentential Modal Logic.Jesse Fitts & David Beisecker - 2019 - Teaching Philosophy 42 (1):41-56.
    This paper will present two contributions to teaching introductory logic. The first contribution is an alternative tree proof method that differs from the traditional one-sided tree method. The second contribution combines this tree system with an index system to produce a user-friendly tree method for sentential modal logic.
    Download  
     
    Export citation  
     
    Bookmark  
  19.  64
    A Gentzen Calculus for Nothing but the Truth.Stefan Wintein & Reinhard Muskens - 2016 - Journal of Philosophical Logic 45 (4):451-465.
    In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  20. Effective Physical Processes and Active Information in Quantum Computing.Ignazio Licata - 2007 - Quantum Biosystems 1 (1):51-65.
    The recent debate on hypercomputation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics.We propose here the idea of “effective physical process” as the essentially physical notion of computation. By using the Bohm and Hiley active information concept we analyze the differences between the standard form (quantum gates) and the non-standard one (adiabatic and morphogenetic) of Quantum Computing, and we point out how its Super-Turing potentialities derive from an incomputable (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21. Computing Nature.Gordana Dodig-Crncovic & Raffaela Giovagnoli - 2013 - Springer.
    The articles in this volume present a selection of works from the Symposium on Natu-ral/Unconventional Computing at AISB/IACAP (British Society for the Study of Artificial Intelligence and the Simulation of Behaviour and The International Association for Computing and Philosophy) World Congress 2012, held at the University of Birmingham, celebrating Turing centenary. This book is about nature considered as the totality of physical existence, the universe. By physical we mean all phenomena - objects and processes - that are possible to detect (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  94
    “Fuzzy Time”, a Solution of Unexpected Hanging Paradox (a Fuzzy Interpretation of Quantum Mechanics).Farzad Didehvar - manuscript
    Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  23. Logically Possible Machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
    I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines and (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  24. A Logical Hole in the Chinese Room.Michael John Shaffer - 2009 - Minds and Machines 19 (2):229-235.
    Searle’s Chinese Room Argument (CRA) has been the object of great interest in the philosophy of mind, artificial intelligence and cognitive science since its initial presentation in ‘Minds, Brains and Programs’ in 1980. It is by no means an overstatement to assert that it has been a main focus of attention for philosophers and computer scientists of many stripes. It is then especially interesting to note that relatively little has been said about the detailed logic of the argument, whatever (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  25. Logical Openness in Cognitive Models.Prof Ignazio Licata - 2008 - Epistemologia:177-192.
    It is here proposed an analysis of symbolic and sub-symbolic models for studying cognitive processes, centered on emergence and logical openness notions. The Theory of logical openness connects the Physics of system/environment relationships to the system informational structure. In this theory, cognitive models can be ordered according to a hierarchy of complexity depending on their logical openness degree, and their descriptive limits are correlated to Gödel-Turing Theorems on formal systems. The symbolic models with low logical openness describe cognition by means (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. How We Naturally Reason.Fred Sommers - manuscript
    In the 17th century, Hobbes stated that we reason by addition and subtraction. Historians of logic note that Hobbes thought of reasoning as “a ‘species of computation’” but point out that “his writing contains in fact no attempt to work out such a project.” Though Leibniz mentions the plus/minus character of the positive and negative copulas, neither he nor Hobbes say anything about a plus/minus character of other common logical words that drive our deductive judgments, words like ‘some’, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. Some Resonances Between Eastern Thought and Integral Biomathics in the Framework of the WLIMES Formalism for Modelling Living Systems.Plamen L. Simeonov & Andree C. Ehresmann - forthcoming - Progress in Biophysics and Molecular Biology 131 (Special).
    Forty-two years ago, Capra published “The Tao of Physics” (Capra, 1975). In this book (page 17) he writes: “The exploration of the atomic and subatomic world in the twentieth century has …. necessitated a radical revision of many of our basic concepts” and that, unlike ‘classical’ physics, the sub-atomic and quantum “modern physics” shows resonances with Eastern thoughts and “leads us to a view of the world which is very similar to the views held by mystics of all ages and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28.  47
    About Fuzzy Time-Particle Interpretation of Quantum Mechanics (It is Not an Innocent One!) Version One.Farzad Didehvar - manuscript
    The major point in [1] chapter 2 is the following claim: “Any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction.” So, in the case we wish to save Classical Logic we should change our Computational Model. As we see in chapter two, the mentioned contradiction is about and around the concept of time, as it is in the contradiction of modified version of paradox. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Talking About Trees and Truth-Conditions.Reinhard Muskens - 2001 - Journal of Logic, Language and Information 10 (4):417-455.
    We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  30. Logique floue et arborescence comme outils de modélisation des catégories en tant que prototypes.Taraneh Javanbakht - 2016 - Dissertation, Université du Québec À Montréal
    The master's thesis of Dr. Taraneh Javanbakht in philosophy that was published at the Université du Québec à Montréal in 2016 includes her innovations in logic and cognitive sciences as well as some parts of her philosophical system, netism. Her logic, tendential logic, that she introduced and developed and its application in cognitive science were also published in her master's thesis in philosophy.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  31. Computation in Physical Systems: A Normative Mapping Account.Paul Schweizer - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer Verlag. pp. 27-47.
    The relationship between abstract formal procedures and the activities of actual physical systems has proved to be surprisingly subtle and controversial, and there are a number of competing accounts of when a physical system can be properly said to implement a mathematical formalism and hence perform a computation. I defend an account wherein computational descriptions of physical systems are high-level normative interpretations motivated by our pragmatic concerns. Furthermore, the criteria of utility and success vary according to our diverse purposes (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  32.  79
    “Fuzzy Time”, From Paradox to Paradox (Does It Solve the Contradiction Between Quantum Mechanics & General Relativity?).Farzad Didehvar - manuscript
    Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. Physical Computation: A Mechanistic Account. [REVIEW]Joe Dewhurst - 2016 - Philosophical Psychology 29 (5):795-797.
    Physical Computation is the summation of Piccinini’s work on computation and mechanistic explanation over the past decade. It draws together material from papers published during that time, but also provides additional clarifications and restructuring that make this the definitive presentation of his mechanistic account of physical computation. This review will first give a brief summary of the account that Piccinini defends, followed by a chapter-by-chapter overview of the book, before finally discussing one aspect of the account in (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  34.  68
    What Do Paraconsistent, Undecidable, Random, Computable and Incomplete Mean? A Review of Godel's Way: Exploits Into an Undecidable World by Gregory Chaitin, Francisco A Doria, Newton C.A. Da Costa 160p (2012) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 278-293.
    In ‘Godel’s Way’ three eminent scientists discuss issues such as undecidability, incompleteness, randomness, computability and paraconsistency. I approach these issues from the Wittgensteinian viewpoint that there are two basic issues which have completely different solutions. There are the scientific or empirical issues, which are facts about the world that need to be investigated observationally and philosophical issues as to how language can be used intelligibly (which include certain questions in mathematics and logic), which need to be decided by looking (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35.  73
    Morphological Computation: Nothing but Physical Computation.Marcin Miłkowski - 2018 - Entropy 10 (20):942.
    The purpose of this paper is to argue against the claim that morphological computation is substantially different from other kinds of physical computation. I show that some (but not all) purported cases of morphological computation do not count as specifically computational, and that those that do are solely physical computational systems. These latter cases are not, however, specific enough: all computational systems, not only morphological ones, may (and sometimes should) be studied in various ways, including their energy (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Computation and Functionalism: Syntactic Theory of Mind Revisited.Murat Aydede - 2005 - In Gurol Irzik & Guven Guzeldere (eds.), Boston Studies in the History and Philosophy of Science. Springer.
    I argue that Stich's Syntactic Theory of Mind (STM) and a naturalistic narrow content functionalism run on a Language of Though story have the same exact structure. I elaborate on the argument that narrow content functionalism is either irremediably holistic in a rather destructive sense, or else doesn't have the resources for individuating contents interpersonally. So I show that, contrary to his own advertisement, Stich's STM has exactly the same problems (like holism, vagueness, observer-relativity, etc.) that he claims plague content-based (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  37. Information, Computation, Cognition. Agency-Based Hierarchies of Levels.Gordana Dodig-Crnkovic - 2016 - In Vincent Müller (ed.), Fundamental Issues of Artificial Intelligence. Zurich: Springer. pp. 139-159.
    This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  38. 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.
    Download  
     
    Export citation  
     
    Bookmark  
  39. Imprecise Probabilities in Quantum Mechanics.Stephan Hartmann - 2015 - In Colleen E. Crangle, Adolfo García de la Sienra & Helen E. Longino (eds.), Foundations and Methods from Mathematics to Neuroscience. Stanford: CSLI Publications. pp. 77-82.
    In his entry on "Quantum Logic and Probability Theory" in the Stanford Encyclopedia of Philosophy, Alexander Wilce (2012) writes that "it is uncontroversial (though remarkable) the formal apparatus quantum mechanics reduces neatly to a generalization of classical probability in which the role played by a Boolean algebra of events in the latter is taken over the 'quantum logic' of projection operators on a Hilbert space." For a long time, Patrick Suppes has opposed this view (see, for example, the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. The Cognitive Basis of Computation: Putting Computation in Its Place.Daniel D. Hutto, Erik Myin, Anco Peeters & Farid Zahnoun - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. London: Routledge. pp. 272-282.
    The mainstream view in cognitive science is that computation lies at the basis of and explains cognition. Our analysis reveals that there is no compelling evidence or argument for thinking that brains compute. It makes the case for inverting the explanatory order proposed by the computational basis of cognition thesis. We give reasons to reverse the polarity of standard thinking on this topic, and ask how it is possible that computation, natural and artificial, might be based on cognition (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  41. Languages, Machines, and Classical Computation.Luis M. Augusto - 2019 - London, UK: College Publications.
    2nd ed. A circumscription of the classical theory of computation building up from the Chomsky hierarchy.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  26
    诺森·亚诺夫斯基《理性外在极限》回顾403p (2013) (Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013)) (修订 2019).Michael Richard Starks - 2020 - In 欢迎来到地球上的地狱: 婴儿,气候变化,比特币,卡特尔,中国,民主,多样性,养成基因,平等,黑客,人权,伊斯兰教,自由主义,繁荣,网络,混乱。饥饿,疾病,暴力,人工智能,战争. Las Vegas, NV USA: Reality Press. pp. 178-191.
    我从维特根斯坦和进化心理学的统一视角,对诺森·亚诺夫斯基的《理性的外在极限》进行了详细的回顾。我指出,语言和数学悖论、不完整、不可定定、可计算性、大脑和宇宙作为计算机等问题的困难,都源于未能在适当的方 面仔细审视我们使用语言的问题。上下文,因此未能将科学事实问题与语言如何工作的问题分开。我讨论了维特根斯坦对不完整、不一致性和不可解释性的看法,以及沃尔珀特对计算极限的工作。总结一下:根据布鲁克林--- 良好的科学,不是那么好的哲学的宇宙。 那些希望从现代两个系统的观点来看为人类行为建立一个全面的最新框架的人,可以查阅我的书《路德维希的哲学、心理学、Mind 和语言的逻辑结构》维特根斯坦和约翰·西尔的《第二部》(2019年)。那些对我更多的作品感兴趣的人可能会看到《会说话的猴子——一个末日星球上的哲学、心理学、科学、宗教和政治——文章和评论2006-201 9年第3次(2019年)和自杀乌托邦幻想21篇世纪4日 (2019).
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43.  72
    Interpolation in 16-Valued Trilattice Logics.Reinhard Muskens & Stefan Wintein - 2018 - Studia Logica 106 (2):345-370.
    In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. A Cognitive Computation Fallacy? Cognition, Computations and Panpsychism.John Mark Bishop - 2009 - Cognitive Computation 1 (3):221-233.
    The journal of Cognitive Computation is defined in part by the notion that biologically inspired computational accounts are at the heart of cognitive processes in both natural and artificial systems. Many studies of various important aspects of cognition (memory, observational learning, decision making, reward prediction learning, attention control, etc.) have been made by modelling the various experimental results using ever-more sophisticated computer programs. In this manner progressive inroads have been made into gaining a better understanding of the many components (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  45. Homo Deceptus: How Language Creates its Own Reality.Bruce Bokor - manuscript
    Homo deceptus is a book that brings together new ideas on language, consciousness and physics into a comprehensive theory that unifies science and philosophy in a different kind of Theory of Everything. The subject of how we are to make sense of the world is addressed in a structured and ordered manner, which starts with a recognition that scientific truths are constructed within a linguistic framework. The author argues that an epistemic foundation of natural language must be understood before laying (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. What is Morphological Computation? On How the Body Contributes to Cognition and Control.Vincent C. Müller & Matej Hoffmann - 2017 - Artificial Life 23 (1):1-24.
    The contribution of the body to cognition and control in natural and artificial agents is increasingly described as “off-loading computation from the brain to the body”, where the body is said to perform “morphological computation”. Our investigation of four characteristic cases of morphological computation in animals and robots shows that the ‘off-loading’ perspective is misleading. Actually, the contribution of body morphology to cognition and control is rarely computational, in any useful sense of the word. We thus distinguish (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Trashing Life’s Tree.L. R. Franklin-Hall - 2010 - Biology and Philosophy 25 (4):689-709.
    The Tree of Life has traditionally been understood to represent the history of species lineages. However, recently researchers have suggested that it might be better interpreted as representing the history of cellular lineages, sometimes called the Tree of Cells. This paper examines and evaluates reasons offered against this cellular interpretation of the Tree of Life. It argues that some such reasons are bad reasons, based either on a false attribution of essentialism, on a misunderstanding of the problem (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  48. Creating Reality.Bruce Bokor - manuscript
    Our commonsense notion of reality is supported by two critical assumptions for which we have little understanding: The conscious experience which underpins the observations integral to the scientific method and language, which is the method by which all theories, scientific or otherwise, are communicated. This book examines both of these matters in detail and arrives at a new theoretical foundation for understanding how nature undertakes the task of building the universe. -/- Creating Reality is a synthesis of Darwin’s The Origin (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Computation on Information, Meaning and Representations. An Evolutionary Approach (World Scientific 2011).Christophe Menant - 2011 - In Dodig-Crnkovic, Gordana & Mark Burgin (eds.), Information and Computation. World Scientific. pp. 255-286.
    Understanding computation as “a process of the dynamic change of information” brings to look at the different types of computation and information. Computation of information does not exist alone by itself but is to be considered as part of a system that uses it for some given purpose. Information can be meaningless like a thunderstorm noise, it can be meaningful like an alert signal, or like the representation of a desired food. A thunderstorm noise participates to the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  50. Contextual Blindness in Implicature Computation.Salvatore Pistoia-Reda - 2017 - Natural Language Semantics 25 (2):109-124.
    In this paper, I defend a grammatical account of scalar implicatures. In particular, I submit new evidence in favor of the contextual blindness principle, assumed in recent versions of the grammatical account. I argue that mismatching scalar implicatures can be generated even when the restrictor of the universal quantifier in a universal alternative is contextually known to be empty. The crucial evidence consists of a hitherto unnoticed oddness asymmetry between formally analogous existential sentences with reference failure NPs. I conclude that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 1000