Results for 'accelerated Turing machine'

1000+ found
Order:
  1. Infinitely Complex Machines.Eric Steinhart - 2007 - In Intelligent Computing Everywhere. Springer. pp. 25-43.
    Infinite machines (IMs) can do supertasks. A supertask is an infinite series of operations done in some finite time. Whether or not our universe contains any IMs, they are worthy of study as upper bounds on finite machines. We introduce IMs and describe some of their physical and psychological aspects. An accelerating Turing machine (an ATM) is a Turing machine that performs every next operation twice as fast. It can carry out infinitely many operations in finite (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. 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  
  3. On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
    This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  4. 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  
  5. 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  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6.  92
    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  
  7. Supermachines and Superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
    If the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible machines whose powers exceed the Church–Turing limit (e.g. accelerating Turing machines). Some of these supermachines realize superminds. Superminds perform cognitive supertasks. Their thoughts are formed in infinitary languages. They perceive and manipulate the infinite detail of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  8. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  80
    Can Machines Be People? Reflections on the Turing Triage Test.Robert Sparrow - 2012 - In Patrick Lin, Keith Abney & George Bekey (eds.), Robot Ethics: The Ethical and Social Implications of Robotics. MIT Press. pp. 301-315.
    In, “The Turing Triage Test”, published in Ethics and Information Technology, I described a hypothetical scenario, modelled on the famous Turing Test for machine intelligence, which might serve as means of testing whether or not machines had achieved the moral standing of people. In this paper, I: (1) explain why the Turing Triage Test is of vital interest in the context of contemporary debates about the ethics of AI; (2) address some issues that complexify the application (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  10.  60
    Wolpert, Chaitin und Wittgenstein über Unmöglichkeit, Unvollständigkeit, das Lügner-Paradoxon, Theismus, die Grenzen der Berechnung, ein nicht-quantenmechanisches Unsicherheitsprinzip und das Universum als Computer – der ultimative Satz in Turing Machine Theory (überarbeitet 2019).Michael Richard Starks - 2020 - In Willkommen in der Hölle auf Erden: Babys, Klimawandel, Bitcoin, Kartelle, China, Demokratie, Vielfalt, Dysgenie, Gleichheit, Hacker, Menschenrechte, Islam, Liberalismus, Wohlstand, Internet, Chaos, Hunger, Krankheit, Gewalt, Künstliche Intelligenz, Krieg. Las Vegas, NV, USA: Reality Press. pp. 186-190.
    Ich habe viele kürzliche Diskussionen über die Grenzen der Berechnung und das Universum als Computer gelesen, in der Hoffnung, einige Kommentare über die erstaunliche Arbeit des Polymath Physikers und Entscheidungstheoretikers David Wolpert zu finden, aber habe kein einziges Zitat gefunden und so präsentiere ich diese sehr kurze Zusammenfassung. Wolpert bewies einige verblüffende Unmöglichkeit oder Unvollständigkeit Theoreme (1992 bis 2008-siehe arxiv dot org) über die Grenzen der Schlussfolgerung (Berechnung), die so allgemein sind, dass sie unabhängig von dem Gerät, das die Berechnung, (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  11.  79
    Turing’s Imitation Game: Still an Impossible Challenge for All Machines and Some Judges––an Evaluation of the 2008 Loebner Contest. [REVIEW]Luciano Floridi & Mariarosaria Taddeo - 2009 - Minds and Machines 19 (1):145-150.
    An evaluation of the 2008 Loebner contest.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  12. Turing on the Integration of Human and Machine Intelligence.S. G. Sterrett - 2014
    Abstract Philosophical discussion of Alan Turing’s writings on intelligence has mostly revolved around a single point made in a paper published in the journal Mind in 1950. This is unfortunate, for Turing’s reflections on machine (artificial) intelligence, human intelligence, and the relation between them were more extensive and sophisticated. They are seen to be extremely well-considered and sound in retrospect. Recently, IBM developed a question-answering computer (Watson) that could compete against humans on the game show Jeopardy! There (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  56
    Turing’s Imitation Game: Still an Impossible Challenge for All Machines and Some Judges.Luciano Floridi, Mariarosaria Taddeo & Matteo Turilli - 2009 - Minds and Machines 19 (1):145–150.
    An Evaluation of the 2008 Loebner Contest.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  14. 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  
  15.  93
    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  
  16.  50
    Wolpert, Chaitin et Wittgenstein sur l’impossibilité, l’incomplétude, le paradoxe menteur, le théisme, les limites du calcul, un principe d’incertitude mécanique non quantique et l’univers comme ordinateur, le théorème ultime dans Turing Machine Theory (révisé 2019).Michael Richard Starks - 2020 - In Bienvenue en Enfer sur Terre : Bébés, Changement climatique, Bitcoin, Cartels, Chine, Démocratie, Diversité, Dysgénique, Égalité, Pirates informatiques, Droits de l'homme, Islam, Libéralisme, Prospérité, Le Web, Chaos, Famine, Maladie, Violence, Intellige. Las Vegas, NV , USA: Reality Press. pp. 185-189.
    J’ai lu de nombreuses discussions récentes sur les limites du calcul et de l’univers en tant qu’ordinateur, dans l’espoir de trouver quelques commentaires sur le travail étonnant du physicien polymathe et théoricien de la décision David Wolpert, mais n’ont pas trouvé une seule citation et je présente donc ce résumé très bref. Wolpert s’est avéré quelques théoricaux d’impossibilité ou d’incomplétude renversants (1992 à 2008-voir arxiv dot org) sur les limites de l’inférence (computation) qui sont si généraux qu’ils sont indépendants de (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17.  31
    असंभव, अपूर्णता, अपूर्णता, झूठा विरोधाभास, सिद्धांतवाद, गणना की सीमा, एक गैर-क्वांटम यांत्रिक अनिश्चितता सिद्धांत और कंप्यूटर के रूप में ब्रह्मांड पर 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  
  18. The Turing Guide.Jack Copeland, Jonathan Bowen, Robin Wilson & Mark Sprevak (eds.) - 2017 - Oxford: Oxford University Press.
    This volume celebrates the various facets of Alan Turing (1912–1954), the British mathematician and computing pioneer, widely considered as the father of computer science. It is aimed at the general reader, with additional notes and references for those who wish to explore the life and work of Turing more deeply. -/- The book is divided into eight parts, covering different aspects of Turing’s life and work. -/- Part I presents various biographical aspects of Turing, some from (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Could a Machine Think? Alan M. Turing Vs. John R. Searle.Günther Mario - unknown
    “Could a machine think?” asks John R. Searle in his paper Minds, Brains, and Programs. He answers that “only a machine could think1, and only very special kinds of machines, namely brains.”2 The subject of this paper is the analysis of the aforementioned question through presentation of the symbol manipulation approach to intelligence and Searle's well-known criticism to this approach, namely the Chinese room argument. The examination of these issues leads to the systems reply of the Chinese room (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  20. 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   4 citations  
  21. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  22. El test de Turing: dos mitos, un dogma.Rodrigo González - 2007 - Revista de Filosofía 63:37-53.
    Este artículo analiza el Test de Turing, uno de los métodos más famosos y controvertidos para evaluar la existencia de vida mental en la Filosofía de la Mente, revelando dos mitos filosóficos comúnmente aceptados y criticando su dogma. En primer lugar, se muestra por qué Turing nunca propuso una definición de inteligencia. En segundo lugar, se refuta que el Test de Turing involucre condiciones necesarias o suficientes para la inteligencia. En tercer lugar, teniendo presente el objetivo y (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  23. Revisiting Turing and His Test: Comprehensiveness, Qualia, and the Real World.Vincent C. Müller & Aladdin Ayesh (eds.) - 2012 - AISB.
    Proceedings of the papers presented at the Symposium on "Revisiting Turing and his Test: Comprehensiveness, Qualia, and the Real World" at the 2012 AISB and IACAP Symposium that was held in the Turing year 2012, 2–6 July at the University of Birmingham, UK. Ten papers. - http://www.pt-ai.org/turing-test --- Daniel Devatman Hromada: From Taxonomy of Turing Test-Consistent Scenarios Towards Attribution of Legal Status to Meta-modular Artificial Autonomous Agents - Michael Zillich: My Robot is Smarter than Your Robot: (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24.  56
    Turing and Computationalism.Napoleon M. Mabaquiao - 2014 - Philosophia: International Journal of Philosophy (Philippine e-journal) 15 (1):50-62.
    Due to his significant role in the development of computer technology and the discipline of artificial intelligence, Alan Turing has supposedly subscribed to the theory of mind that has been greatly inspired by the power of the said technology which has eventually become the dominant framework for current researches in artificial intelligence and cognitive science, namely, computationalism or the computational theory of mind. In this essay, I challenge this supposition. In particular, I will try to show that there is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  25. Turing and the Evaluation of Intelligence.Francesco Bianchini - 2014 - Isonomia: Online Philosophical Journal of the University of Urbino:1-18.
    The article deals with some ideas by Turing concerning the background and the birth of the well-known Turing Test, showing the evolution of the main question proposed by Turing on thinking machine. The notions he used, especially that one of imitation, are not so much exactly defined and shaped, but for this very reason they have had a deep impact in artificial intelligence and cognitive science research from an epistemological point of view. Then, it is suggested (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. ‘The Action of the Brain’. Machine Models and Adaptive Functions in Turing and Ashby.Hajo Greif - 2018 - In Vincent Müller (ed.), Philosophy and theory of artificial intelligence 2017. Berlin, Germany: 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. 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   2 citations  
  28.  35
    Arithmetic Logical Irreversibility and the Turing's Halt Problem.Yair Lapin - manuscript
    A new approach to the halting problem of the Turing machine using different interpretations of the Shannon measure of the information on the computational process represented as a distribution of events and defining a new concept of arithmetic logical irreversibility and memory erasure that generate uncertainty and computational improbability due to loss of information during computation. Different computational steps (input) can give the same result (next step, output) introducing thus information entropy in the computing process and uncertainty about (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Máquinas sin engranajes y cuerpos sin mentes. ¿cuán dualista es el funcionalismo de máquina de Turing?Rodrigo González - 2011 - Revista de Filosofía 67:183-200.
    En este trabajo examino cómo el Funcionalismo de Máquina de Turing resulta compatible con una forma de dualismo, lo que aleja a la IA clásica o fuerte del materialismo que la inspiró originalmente en el siglo XIX. Para sostener esta tesis, argumento que efectivamente existe una notable cercanía entre el pensamiento cartesiano y dicho funcionalismo, ya que el primero afirma que es concebible/posible separar mente y cuerpo, mientras que el segundo sostiene que no es estrictamente necesario que los estados (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  30.  48
    Walking Through the Turing Wall.Albert Efimov - forthcoming - In Teces.
    Can the machines that play board games or recognize images only in the comfort of the virtual world be intelligent? To become reliable and convenient assistants to humans, machines need to learn how to act and communicate in the physical reality, just like people do. The authors propose two novel ways of designing and building Artificial General Intelligence (AGI). The first one seeks to unify all participants at any instance of the Turing test – the judge, the machine, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31.  24
    Walking Through The Turing Wall.Albert Efimov - 2021 - IFAC Papers Online 54 (13):215-220.
    Can the machines that play board games or recognize images only in the comfort of the virtual world be intelligent? To become reliable and convenient assistants to humans, machines need to learn how to act and communicate in the physical reality, just like people do. The authors propose two novel ways of designing and building Artificial General Intelligence (AGI). The first one seeks to unify all participants at any instance of the Turing test – the judge, the machine, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32.  41
    The X86 Language has Turing Complete Memory Access.Pl 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  
  33.  38
    Wolpert, Chaitin and Wittgenstein 불가능, 불완전 성, 거짓말 쟁이 역설, 신념, 전산 한계, 비 양자 역학적 불확실성 원리 및 -Turing 기계 이론의 궁극적 이론(.Michael Richard Starks - 2020 - In 지구상의 지옥에 오신 것을 환영합니다 : 아기, 기후 변화, 비트 코인, 카르텔, 중국, 민주주의, 다양성, 역학, 평등, 해커, 인권, 이슬람, 자유주의, 번영, 웹, 혼돈, 기아, 질병, 폭력, 인공 지능, 전쟁. Las Vegas, NV USA: Reality Press. pp. 201-209.
    나는 컴퓨터로 계산과 우주의 한계에 대한 많은 최근의 토론을 읽었습니다, polymath 물리학자 및 결정 이론가 데이비드 울퍼트의 놀라운 작품에 대한 몇 가지 의견을 찾을 수 있기를 바라고 있지만 하나의 인용을 발견하지 않은 그래서 나는이 매우 간단한 요약을 제시. Wolpert는 계산을 수행하는 장치와 는 별개이며 물리학법칙과는 무관하므로 컴퓨터, 물리학 및 인간의 행동에 적용되므로 추론(계산)에 대한 제한에 대해 놀라운 불가능또는 불완전성 정리(1992년에서 2008년 참조 arxiv dot org)를 입증했습니다. 그들은 캔터의 대각선화, 거짓말쟁이 역설 및 세계관을 사용하여 튜링 머신 이론의 궁극적 인 정리가 될 (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  34.  14
    MInd and Machine: At the Core of Any Black Box There Are Two (or More) White Boxes Required to Stay In.Lance Nizami - 2020 - Cybernetics and Human Knowing 27 (3):9-32.
    This paper concerns the Black Box. It is not the engineer’s black box that can be opened to reveal its mechanism, but rather one whose operations are inferred through input from (and output to) a companion observer. We are observers ourselves, and we attempt to understand minds through interactions with their host organisms. To this end, Ranulph Glanville followed W. Ross Ashby in elaborating the Black Box. The Black Box and its observer together form a system having different properties than (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Davidson's No-Priority Thesis in Defending the Turing Test.Mohammad Reza Vaez Shahrestani - 2012 - Procedia - Social and Behavioral Sciences 32:456-461.
    Turing does not provide an explanation for substituting the original question of his test – i.e., “Can machines think?” with “Can a machine pass the imitation game?” – resulting in an argumentative gap in his main thesis. In this article, I argue that a positive answer to the second question would mean attributing the ability of linguistic interactions to machines; while a positive answer to the original question would mean attributing the ability of thinking to machines. In such (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. 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  
  37.  23
    Computing Machinery and Sexual Difference: The Sexed Presuppositions Underlying the Turing Test.Amy Kind - forthcoming - In Jennifer McWeeny & Keya Maitra (eds.), Feminist Philosophy of Mind.
    In his 1950 paper “Computing Machinery and Intelligence,” Alan Turing proposed that we can determine whether a machine thinks by considering whether it can win at a simple imitation game. A neutral questioner communicates with two different systems – one a machine and a human being – without knowing which is which. If after some reasonable amount of time the machine is able to fool the questioner into identifying it as the human, the machine wins (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38.  82
    An Empathy Imitation Game: Empathy Turing Test for Care- and Chat-Bots.Jeremy Howick, Jessica Morley & Luciano Floridi - 2021 - Minds and Machines 31 (3):1–⁠5.
    AI, in the form of artificial carers, provides a possible solution to the problem of a growing elderly population Yet, concerns remain that artificial carers ( such as care-or chat-bots) could not emphathize with patients to the extent that humans can. Utilising the concept of empathy perception,we propose a Turing-type test that could check whether artificial carers could do many of the menial tasks human carers currently undertake, and in the process, free up more time for doctors to offer (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Laws of Form and the Force of Function: Variations on the Turing Test.Hajo Greif - 2012 - In Vincent C. Müller & Aladdin Ayesh (eds.), 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  
  40. MICHAEL POLANYI: CAN THE MIND BE REPRESENTED BY A MACHINE?Paul Richard Blum - 2010 - Polanyiana 19 (1-2):35-60.
    In 1949, the Department of Philosophy at the University of Manchester organized a symposium “Mind and Machine” with Michael Polanyi, the mathematicians Alan Turing and Max Newman, the neurologists Geoff rey Jeff erson and J. Z. Young, and others as participants. Th is event is known among Turing scholars, because it laid the seed for Turing’s famous paper on “Computing Machinery and Intelligence”, but it is scarcely documented. Here, the transcript of this event, together with Polanyi’s (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  41.  24
    Thought, Sign and Machine - the Idea of the Computer Reconsidered.Niels Ole Finnemann (ed.) - 1999 - Copernhagen: Danish Original: Akademisk Forlag 1994. Tanke, Sprog og Maskine..
    Throughout what is now the more than 50-year history of the computer many theories have been advanced regarding the contribution this machine would make to changes both in the structure of society and in ways of thinking. Like other theories regarding the future, these should also be taken with a pinch of salt. The history of the development of computer technology contains many predictions which have failed to come true and many applications that have not been foreseen. While we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42. Vindication of the Rights of Machine.Kris Rhodes - manuscript
    In this paper, I argue that certain Machines can have rights independently of whether they are sentient, or conscious, or whatever you might call it.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43. 沃尔珀特、柴廷和维特根斯坦关于不可能、不完整、说谎的悖论、有论、计算极限、非量子力学不确定性原理和宇宙作为计算机——图灵机器理论的终极定理 (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  
  44. Review of The Emotion Machine by Marvin Minsky (2007).Michael Starks - 2016 - In Suicidal Utopian Delusions in the 21st Century: Philosophy, Human Nature and the Collapse of Civilization-- Articles and Reviews 2006-2017 2nd Edition Feb 2018. Michael Starks. pp. 627.
    Dullest book by a major scientist I have ever read. I suppose if you know almost nothing about cognition or AI research you might find this book useful. For anyone else it is a horrific bore. There are hundreds of books in cog sci, robotics, AI, evolutionary psychology and philosophy offering far more info and insight on cognition than this one. Minsky is a top rate senior scientist but it barely shows here. He has alot of good references but they (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. The Tyranny of Transparency: Auto-Immunity in The Teaching Machine.Ingrid Maria Hoofd - 2016 - Teorie Vědy / Theory of Science 38 (1):87-112.
    This article proposes that the prime ideals of the university - those of truth, knowledge, justice, and emancipation - are also those that currently produce unjust practices "outside" and "within". Using the work of Jacques Derrida and Paul Virilio, the article argues that the central problem of the university today consists not so much of a neo-liberalisation, but of the speeding-up of these ideals through their enmeshment with techniques of calculation, vision, and prediction. The current university therefore suffers from what (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46.  31
    THE APPEARANCE OF CONSCIOUSNESS IN MACHINES.Desmond Sander - manuscript
    This is merely the longish abstract of a talk I gave in 2001, that now seems to make more sense than ever.
    Download  
     
    Export citation  
     
    Bookmark  
  47.  37
    Квантовият компютър: квантовите ординали и типовете алгоритмична неразрешимост.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  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  48. 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  
  49. Computability and Human Symbolic Output.Jason Megill & Tim Melvin - 2014 - Logic and Logical Philosophy 23 (4):391-401.
    This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in human history, even at moments in the distant future, this set is finite. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. 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. Being outside it, (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000