Results for ' model, quantum computer, reality, Turing machine'

975 found
Order:
  1. Quantum Computer: Quantum Model and Reality.Vasil Penchev - 2020 - Epistemology eJournal (Elsevier: SSRN) 13 (17):1-7.
    Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum model unlike a classical model can coincide with reality. Reality can be interpreted as a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
    A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.
    A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano arithmetics (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Cosmos is a (fatalistic) state machine: Objective theory (cosmos, objective reality, scientific image) vs. Subjective theory (consciousness, subjective reality, manifest image).Xiaoyang Yu - manuscript
    As soon as you believe an imagination to be nonfictional, this imagination becomes your ontological theory of the reality. Your ontological theory (of the reality) can describe a system as the reality. However, actually this system is only a theory/conceptual-space/imagination/visual-imagery of yours, not the actual reality (i.e., the thing-in-itself). An ontological theory (of the reality) actually only describes your (subjective/mental) imagination/visual-imagery/conceptual-space. An ontological theory of the reality, is being described as a situation model (SM). There is no way to prove/disprove (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. From Analog to Digital Computing: Is Homo sapiens’ Brain on Its Way to Become a Turing Machine?Antoine Danchin & André A. Fenton - 2022 - Frontiers in Ecology and Evolution 10:796413.
    The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. The Kochen - Specker theorem in quantum mechanics: a philosophical comment (part 1).Vasil Penchev - 2013 - Philosophical Alternatives 22 (1):67-77.
    Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  7. My mind is not the universe: the map is not the territory.Xiaoyang Yu - manuscript
    In order to describe my findings/conclusions systematically, a new semantic system (i.e., a new language) has to be intentionally defined by the present article. Humans are limited in what they know by the technical limitation of their cortical language network. A reality is a situation model (SM). For example, the conventionally-called “physical reality” around my conventionally-called “physical body” is actually a “geometric” SM of my brain. The universe is an autonomous objective parallel computing automaton which evolves by itself automatically/unintentionally – (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Turing Machines and Semantic Symbol Processing: Why Real Computers Don’t Mind Chinese Emperors.Richard Yee - 1993 - Lyceum 5 (1):37-59.
    Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. David Wolpert on impossibility, incompleteness, the liar paradox, the limits of computation, a non-quantum mechanical uncertainty principle and the universe as computer—the ultimate theorem in Turing Machine Theory.Michael Starks - manuscript
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. “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  
     
    Export citation  
     
    Bookmark   6 citations  
  11. 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 (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. 294-299.
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12.  13
    Quantum-Based Consciousness Through the Universal Law of Balance.Angelito Malicse - manuscript
    Quantum-Based Consciousness Through the Universal Law of Balance -/- By Angelito Enriquez Malicse -/- Introduction -/- The nature of consciousness remains one of the most profound mysteries in science and philosophy. Traditional approaches, from Cartesian dualism to modern neuroscience, have attempted to explain consciousness as either separate from or entirely reducible to physical processes. However, neither classical physics nor standard cognitive science fully captures the depth of subjective experience. -/- Recent developments in quantum mechanics suggest that consciousness may (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. A Quantum Computer in a 'Chinese Room'.Vasil Penchev - 2020 - Mechanical Engineering eJournal (Elsevier: SSRN) 3 (155):1-8.
    Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. The GOOGLE and XPRIZE award for how to use quantum computers practically: The problem of the “P” versus “NP” outputs of any quantum computer and the pathway for its resolving.Vasil Penchev - 2025 - Quantum Information Ejournal (Elsevier: Ssrn) 4 (26):1-80.
    The GOOGLE and XPRIZE $5,000,000 for the practical and socially useful utilization of the quantum computer is the starting point for ontomathematical reflections for what it can really serve. Its “output by measurement” is opposed to the conjecture for a coherent ray able alternatively to deliver the ultimate result of any quantum calculation immediately as a Dirac -function therefore accomplishing the transition of the sequence of increasingly narrow probability density distributions to their limit. The GOOGLE and XPRIZE problem’s (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15. Natural Argument by a Quantum Computer.Vasil Penchev - 2020 - Computing Methodology eJournal (Elsevier: SSRN) 3 (30):1-8.
    Natural argument is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary natural arguments in any data. That ability of natural argument is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. असंभव, अपूर्णता, अपूर्णता, झूठा विरोधाभास, सिद्धांतवाद, गणना की सीमा, एक गैर-क्वांटम यांत्रिक अनिश्चितता सिद्धांत और कंप्यूटर के रूप में ब्रह्मांड पर 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 पृथ्वी पर नर्क में आपका स्वागत है: शिशुओं, जलवायु परिवर्तन, बिटकॉइन, कार्टेल, चीन, लोकतंत्र, विविधता, समानता, हैकर्स, मानव अधिकार, इस्लाम, उदारवाद, समृद्धि, वेब, अराजकता, भुखमरी, बीमारी, हिंसा, कृत्रिम बुद्धिमत्ता, युद्ध. Ls Vegas, NV USA: Reality Press. pp. 215-220.
    मैं कंप्यूटर के रूप में गणना और ब्रह्मांड की सीमा के कई हाल ही में चर्चा पढ़ लिया है, polymath भौतिक विज्ञानी और निर्णय सिद्धांतकार डेविड Wolpert के अद्भुत काम पर कुछ टिप्पणी खोजने की उम्मीद है, लेकिन एक भी प्रशस्ति पत्र नहीं मिला है और इसलिए मैं यह बहुत संक्षिप्त मौजूद सारांश. Wolpert कुछ आश्चर्यजनक असंभव या अधूरापन प्रमेयों साबित कर दिया (1992 से 2008-देखें arxiv dot org) अनुमान के लिए सीमा पर (कम्प्यूटेशन) कि इतने सामान्य वे गणना कर (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. (1 other version)Platonic Computer— the Universal Machine That Bridges the “Inverse Explanatory Gap” in the Philosophy of Mind.Simon X. Duan - 2022 - Filozofia i Nauka 10:285-302.
    The scope of Platonism is extended by introducing the concept of a “Platonic computer” which is incorporated in metacomputics. The theoretical framework of metacomputics postulates that a Platonic computer exists in the realm of Forms and is made by, of, with, and from metaconsciousness. Metaconsciousness is defined as the “power to conceive, to perceive, and to be self-aware” and is the formless, con-tentless infinite potentiality. Metacomputics models how metaconsciousness generates the perceived actualities including abstract entities and physical and nonphysical realities. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18.  30
    The Integration of Angelito Malicse’s Universal Formula with Quantum Computer Design, AGI Algorithmic Design, and Education.Angelito Malicse - manuscript
    -/- The Integration of Angelito Malicse’s Universal Formula with Quantum Computer Design, AGI Algorithmic Design, and Education -/- In the pursuit of developing intelligent systems, the realms of quantum computing, artificial general intelligence (AGI), and educational frameworks face the significant challenge of balancing complex feedback mechanisms, ethical decision-making, and system stability. The universal formula developed by Angelito Malicse provides a pioneering approach to understanding free will, human behavior, and decision-making. His three laws, deeply rooted in the concept of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Algebraic structures of neutrosophic triplets, neutrosophic duplets, or neutrosophic multisets. Volume I.Florentin Smarandache, Xiaohong Zhang & Mumtaz Ali - 2018 - Basel, Switzerland: MDPI. Edited by Florentin Smarandache, Xiaohong Zhang & Mumtaz Ali.
    The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Algebraic structures of neutrosophic triplets, neutrosophic duplets, or neutrosophic multisets. Volume II.Florentin Smarandache, Xiaohong Zhang & Mumtaz Ali - 2019 - Basel, Switzerland: MDPI.
    The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21.  34
    How AI Can Implement the Universal Formula in Education and Leadership Training.Angelito Malicse - manuscript
    How AI Can Implement the Universal Formula in Education and Leadership Training -/- If AI is programmed based on your universal formula, it can serve as a powerful tool for optimizing human intelligence, education, and leadership decision-making. Here’s how AI can be integrated into your vision: -/- 1. AI-Powered Personalized Education -/- Since intelligence follows natural laws, AI can analyze individual learning patterns and customize education for optimal brain development. -/- Adaptive Learning Systems – AI can adjust lessons in real (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Tools or toys? On specific challenges for modeling and the epistemology of models and computer simulations in the social sciences.Eckhart Arnold - manuscript
    Mathematical models are a well established tool in most natural sciences. Although models have been neglected by the philosophy of science for a long time, their epistemological status as a link between theory and reality is now fairly well understood. However, regarding the epistemological status of mathematical models in the social sciences, there still exists a considerable unclarity. In my paper I argue that this results from specific challenges that mathematical models and especially computer simulations face in the social sciences. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. The computable universe: from prespace metaphysics to discrete quantum mechanics.Martin Leckey - 1997 - Dissertation, Monash University
    The central motivating idea behind the development of this work is the concept of prespace, a hypothetical structure that is postulated by some physicists to underlie the fabric of space or space-time. I consider how such a structure could relate to space and space-time, and the rest of reality as we know it, and the implications of the existence of this structure for quantum theory. Understanding how this structure could relate to space and to the rest of reality requires, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. Квантовият компютър: квантовите ординали и типовете алгоритмична неразрешимост.Vasil Penchev - 2005 - Philosophical Alternatives 14 (6):59-71.
    A definition of quantum computer is supposed: as a countable set of Turing machines on the ground of: quantum parallelism, reversibility, entanglement. Qubit is the set of all the i–th binary location cells transforming in parallel by unitary matrices. The Church thesis is suggested in the form relevat to quantum computer. The notion of the non–finite (but not infinite) potency of a set is introduced .
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25. 沃尔珀特、柴廷和维特根斯坦关于不可能、不完整、说谎的悖论、有论、计算极限、非量子力学不确定性原理和宇宙作为计算机——图灵机器理论的终极定理 (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  
     
    Export citation  
     
    Bookmark  
  26. ‘The Action of the Brain’. Machine Models and Adaptive Functions in Turing and Ashby.Hajo Greif - 2017 - In Vincent C. Müller, Philosophy and theory of artificial intelligence 2017. Berlin: Springer. pp. 24-35.
    Given the personal acquaintance between Alan M. Turing and W. Ross Ashby and the partial proximity of their research fields, a comparative view of Turing’s and Ashby’s work on modelling “the action of the brain” (letter from Turing to Ashby, 1946) will help to shed light on the seemingly strict symbolic/embodied dichotomy: While it is clear that Turing was committed to formal, computational and Ashby to material, analogue methods of modelling, there is no straightforward mapping of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. Wolpert, Chaitin and Wittgenstein on impossibility, incompleteness, the limits of computation, theism and the universe as computer-the ultimate Turing Theorem.Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization Michael Starks 3rd Ed. (2017).
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. Отвъд машината на Тюринг: квантовият компютър.Vasil Penchev - 2014 - Sofia: BAS: ISSK (IPS).
    Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Emergence and Computation at the Edge of Classical and Quantum Systems.Ignazio Licata - 2008 - In World Scientific, Physics of Emergence and Organization.
    The problem of emergence in physical theories makes necessary to build a general theory of the relationships between the observed system and the observing system. It can be shown that there exists a correspondence between classical systems and computational dynamics according to the Shannon-Turing model. A classical system is an informational closed system with respect to the observer; this characterizes the emergent processes in classical physics as phenomenological emergence. In quantum systems, the analysis based on the computation theory (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  30. Why computers can't feel pain.John Mark Bishop - 2009 - Minds and Machines 19 (4):507-516.
    The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  31. Computers, Dynamical Systems, Phenomena, and the Mind.Marco Giunti - 1992 - Dissertation, Indiana University
    This work addresses a broad range of questions which belong to four fields: computation theory, general philosophy of science, philosophy of cognitive science, and philosophy of mind. Dynamical system theory provides the framework for a unified treatment of these questions. ;The main goal of this dissertation is to propose a new view of the aims and methods of cognitive science--the dynamical approach . According to this view, the object of cognitive science is a particular set of dynamical systems, which I (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  32. Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics.Markus Pantsar - 2021 - Minds and Machines 31 (1):75-98.
    In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  33. Modelling Empty Representations: The Case of Computational Models of Hallucination.Marcin Miłkowski - 2017 - In Gordana Dodig-Crnkovic & Raffaela Giovagnoli, Representation of Reality: Humans, Other Living Organism and Intelligent Machines. Heidelberg: Springer. pp. 17--32.
    I argue that there are no plausible non-representational explanations of episodes of hallucination. To make the discussion more specific, I focus on visual hallucinations in Charles Bonnet syndrome. I claim that the character of such hallucinatory experiences cannot be explained away non-representationally, for they cannot be taken as simple failures of cognizing or as failures of contact with external reality—such failures being the only genuinely non-representational explanations of hallucinations and cognitive errors in general. I briefly introduce a recent computational model (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. A Proposed Taxonomy for the Evolutionary Stages of Artificial Intelligence: Towards a Periodisation of the Machine Intellect Era.Demetrius Floudas - manuscript
    As artificial intelligence (AI) systems continue their rapid advancement, a framework for contextualising the major transitional phases in the development of machine intellect becomes increasingly vital. This paper proposes a novel chronological classification scheme to characterise the key temporal stages in AI evolution. The Prenoëtic era, spanning all of history prior to the year 2020, is defined as the preliminary phase before substantive artificial intellect manifestations. The Protonoëtic period, which humanity has recently entered, denotes the initial emergence of advanced (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Turing Test, Chinese Room Argument, Symbol Grounding Problem. Meanings in Artificial Agents (APA 2013).Christophe Menant - 2013 - American Philosophical Association Newsletter on Philosophy and Computers 13 (1):30-34.
    The Turing Test (TT), the Chinese Room Argument (CRA), and the Symbol Grounding Problem (SGP) are about the question “can machines think?” We propose to look at these approaches to Artificial Intelligence (AI) by showing that they all address the possibility for Artificial Agents (AAs) to generate meaningful information (meanings) as we humans do. The initial question about thinking machines is then reformulated into “can AAs generate meanings like humans do?” We correspondingly present the TT, the CRA and the (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  36. 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, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. A Formal Model of Metaphor in Frame Semantics.Vasil Penchev - 2015 - In Proceedings of the 41st Annual Convention of the Society for the Study of Artificial Intelligence and the Simulation of Behaviour. New York: Curran Associates, Inc.. pp. 187-194.
    A formal model of metaphor is introduced. It models metaphor, first, as an interaction of “frames” according to the frame semantics, and then, as a wave function in Hilbert space. The practical way for a probability distribution and a corresponding wave function to be assigned to a given metaphor in a given language is considered. A series of formal definitions is deduced from this for: “representation”, “reality”, “language”, “ontology”, etc. All are based on Hilbert space. A few statements about a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
    The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  39. Is there any real substance to the claims for a 'new computationalism'?Alberto Hernandez-Espinosa, Hernandez-Quiroz Francisco & Zenil Hector - forthcoming - In Hernandez-Espinosa Alberto, Francisco Hernandez-Quiroz & Hector Zenil, CiE Computability in Europe 2017. Springer Verlag.
    'Computationalism' is a relatively vague term used to describe attempts to apply Turing's model of computation to phenomena outside its original purview: in modelling the human mind, in physics, mathematics, etc. Early versions of computationalism faced strong objections from many (and varied) quarters, from philosophers to practitioners of the aforementioned disciplines. Here we will not address the fundamental question of whether computational models are appropriate for describing some or all of the wide range of processes that they have been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. The x86 language has Turing Complete memory access.P. Olcott - manuscript
    An abstract machine having a tape head that can be advanced in 0 to 0x7FFFFFFF increments an unlimited number of times specifies a model of computation that has access to unlimited memory. The technical name for memory addressing based on displacement from the current memory address is relative addressing.
    Download  
     
    Export citation  
     
    Bookmark  
  41. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42.  10
    The Relationship Between Language, Mathematics, Information, Knowledge, and New Discoveries in Understanding the Nature of Consciousness.Angelito Malicse - manuscript
    The Relationship Between Language, Mathematics, Information, Knowledge, and New Discoveries in Understanding the Nature of Consciousness -/- Introduction -/- The nature of consciousness has long been a subject of philosophical and scientific inquiry. As human intelligence evolved, the invention of language, mathematics, and information systems became fundamental tools in shaping how we perceive and understand reality. These intellectual advancements not only reflect consciousness but also influence its development. By examining the interplay between language, mathematics, information, knowledge, and new discoveries, we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. 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. It is natural (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. The Turing Machine on the Dissecting Table.Jana Horáková - 2013 - Teorie Vědy / Theory of Science 35 (2):269-288.
    Since the beginning of the twenty-first century there has been an increasing awareness that software rep- resents a blind spot in new media theory. The growing interest in software also influences the argument in this paper, which sets out from the assumption that Alan M. Turing's concept of the universal machine, the first theoretical description of a computer program, is a kind of bachelor machine. Previous writings based on a similar hypothesis have focused either on a comparison (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Philosophy and Science, the Darwinian-Evolved Computational Brain, a Non-Recursive Super-Turing Machine & Our Inner-World-Producing Organ.Hermann G. W. Burchard - 2016 - Open Journal of Philosophy 6 (1):13-28.
    Recent advances in neuroscience lead to a wider realm for philosophy to include the science of the Darwinian-evolved computational brain, our inner world producing organ, a non-recursive super- Turing machine combining 100B synapsing-neuron DNA-computers based on the genetic code. The whole system is a logos machine offering a world map for global context, essential for our intentional grasp of opportunities. We start from the observable contrast between the chaotic universe vs. our orderly inner world, the noumenal cosmos. (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  46. Laws of Form and the Force of Function: Variations on the Turing Test.Hajo Greif - 2012 - In Vincent C. Müller & Aladdin Ayesh, Revisiting Turing and His Test: Comprehensiveness, Qualia, and the Real World. AISB. pp. 60-64.
    This paper commences from the critical observation that the Turing Test (TT) might not be best read as providing a definition or a genuine test of intelligence by proxy of a simulation of conversational behaviour. Firstly, the idea of a machine producing likenesses of this kind served a different purpose in Turing, namely providing a demonstrative simulation to elucidate the force and scope of his computational method, whose primary theoretical import lies within the realm of mathematics rather (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47.  30
    The Brachistochrone Theory of Consciousness & Reality Navigation.Matthew Stewart - manuscript
    This paper proposes a novel framework for understanding consciousness as a dynamic navigator of parallel realities, guided by principles of least-action optimization akin to the brachistochrone curve in physics. Rather than moving linearly through time, consciousness may instead be selecting optimal trajectories across a pre-existing structure of potential realities, ensuring continuity and coherence in perceived experience. By drawing parallels to quantum wavefunction collapse, black hole thermodynamics, and Hawking radiation, we explore how dreams may function as a subconscious dissipation mechanism, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Agent-Based Computational Economics: Overview and Brief History.Leigh Tesfatsion - 2023 - In Ragupathy Venkatachalam, Artificial Intelligence, Learning, and Computation in Economics and Finance. Cham: Springer. pp. 41-58.
    Scientists and engineers seek to understand how real-world systems work and could work better. Any modeling method devised for such purposes must simplify reality. Ideally, however, the modeling method should be flexible as well as logically rigorous; it should permit model simplifications to be appropriately tailored for the specific purpose at hand. Flexibility and logical rigor have been the two key goals motivating the development of Agent-based Computational Economics (ACE), a completely agent-based modeling method characterized by seven specific modeling principles. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Quantum Mechanical Reality: Entanglement and Decoherence.Avijit Lahiri - manuscript
    We look into the ontology of quantum theory as distinct from that of the classical theory in the sciences. Theories carry with them their own ontology while the metaphysics may remain the same in the background. We follow a broadly Kantian tradition, distinguishing between the noumenal and phenomenal realities where the former is independent of our perception while the latter is assembled from the former by means of fragmentary bits of interpretation. Theories do not tell us how the noumenal (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. On the Claim that a Table-Lookup Program Could Pass the Turing Test.Drew McDermott - 2014 - Minds and Machines 24 (2):143-188.
    The claim has often been made that passing the Turing Test would not be sufficient to prove that a computer program was intelligent because a trivial program could do it, namely, the “Humongous-Table (HT) Program”, which simply looks up in a table what to say next. This claim is examined in detail. Three ground rules are argued for: (1) That the HT program must be exhaustive, and not be based on some vaguely imagined set of tricks. (2) That the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
1 — 50 / 975