Results for 'Turing machine'

959 found
Order:
  1. 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  
  2. 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  
  3. 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  
  4. 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  
  5. 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  
  6. 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  
  7. 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  
  8. 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. 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  
     
    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. (1 other version)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  
  11. Can machines think? The controversy that led to the Turing test.Bernardo Gonçalves - 2023 - AI and Society 38 (6):2499-2509.
    Turing’s much debated test has turned 70 and is still fairly controversial. His 1950 paper is seen as a complex and multilayered text, and key questions about it remain largely unanswered. Why did Turing select learning from experience as the best approach to achieve machine intelligence? Why did he spend several years working with chess playing as a task to illustrate and test for machine intelligence only to trade it out for conversational question-answering in 1950? Why (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  12. 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  
     
    Export citation  
     
    Bookmark  
  13. Can machines be people? Reflections on the Turing triage test.Robert Sparrow - 2011 - In Patrick Lin, Keith Abney & George A. 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   15 citations  
  14. (1 other version)Turing on the Integration of Human and Machine Intelligence.Susan Sterrett - 2017 - In Alisa Bokulich & Juliet Floyd (eds.), Philosophical Explorations of the Legacy of Alan Turing. Springer Verlag. pp. 323-338.
    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 are (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. 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   14 citations  
  16. 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   12 citations  
  17. 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   3 citations  
  18. 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  
     
    Export citation  
     
    Bookmark  
  19. L'interaction humain-machine à la lumière de Turing et Wittgenstein.Charles Bodon - 2023 - Revue Implications Philosophiques.
    Nous proposons une étude de la constitution du sens dans l'interaction humain-machine à partir des définitions que donnent Turing et Wittgenstein à propos de la pensée, la compréhension, et de la décision. Nous voulons montrer par l'analyse comparative des proximités et différences conceptuelles entre les deux auteurs que le sens commun entre humains et machines se co-constitue dans et à partir de l'action, et que c'est précisément dans cette co-constitution que réside la valeur sociale de leur interaction. Il (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. 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  
  21. Turing’s Three Senses of “Emotional”.Diane Proudfoot - 2014 - International Journal of Synthetic Emotions 5 (2):7-20.
    Turing used the expression “emotional” in three distinct ways: to state his philosophical theory of the concept of intelligence, to classify arguments for and against the possibility of machine intelligence, and to describe the education of a “child machine”. The remarks on emotion include several of the most important philosophical claims. This paper analyses these remarks and their significance for current research in Artificial Intelligence.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. 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  
  23. 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  
  24. Rethinking Turing’s Test and the Philosophical Implications.Diane Proudfoot - 2020 - Minds and Machines 30 (4):487-512.
    In the 70 years since Alan Turing’s ‘Computing Machinery and Intelligence’ appeared in Mind, there have been two widely-accepted interpretations of the Turing test: the canonical behaviourist interpretation and the rival inductive or epistemic interpretation. These readings are based on Turing’s Mind paper; few seem aware that Turing described two other versions of the imitation game. I have argued that both readings are inconsistent with Turing’s 1948 and 1952 statements about intelligence, and fail to explain (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  25. 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  
  26. Turing's two tests for intelligence.Susan G. Sterrett - 1999 - Minds and Machines 10 (4):541-559.
    On a literal reading of `Computing Machinery and Intelligence'', Alan Turing presented not one, but two, practical tests to replace the question `Can machines think?'' He presented them as equivalent. I show here that the first test described in that much-discussed paper is in fact not equivalent to the second one, which has since become known as `the Turing Test''. The two tests can yield different results; it is the first, neglected test that provides the more appropriate indication (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  27. 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  
  28. Turing test: 50 years later.Ayse Pinar Saygin, Ilyas Cicekli & Varol Akman - 2000 - Minds and Machines 10 (4):463-518.
    The Turing Test is one of the most disputed topics in artificial intelligence, philosophy of mind, and cognitive science. This paper is a review of the past 50 years of the Turing Test. Philosophical debates, practical developments and repercussions in related disciplines are all covered. We discuss Turing's ideas in detail and present the important comments that have been made on them. Within this context, behaviorism, consciousness, the 'other minds' problem, and similar topics in philosophy of mind (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  29. ‘The Action of the Brain’. Machine Models and Adaptive Functions in Turing and Ashby.Hajo Greif - 2017 - In Vincent C. Müller (ed.), 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  
  30. A Minimal Turing Test: Reciprocal Sensorimotor Contingencies for Interaction Detection.Pamela Barone, Manuel G. Bedia & Antoni Gomila - 2020 - Frontiers in Human Neuroscience 14:481235.
    In the classical Turing test, participants are challenged to tell whether they are interacting with another human being or with a machine. The way the interaction takes place is not direct, but a distant conversation through computer screen messages. Basic forms of interaction are face-to-face and embodied, context-dependent and based on the detection of reciprocal sensorimotor contingencies. Our idea is that interaction detection requires the integration of proprioceptive and interoceptive patterns with sensorimotor patterns, within quite short time lapses, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  31. ¿Existen las Máquinas Aceleradas de Turing? Paradojas y posibilidades lógicas.Jose Alejandro Fernández Cuesta - 2023 - Techno Review. International Technology, Science and Society Review 13 (1):49.74.
    Las máquinas aceleradas de Turing (ATMs) son dispositivos capaces de ejecutar súper-tareas. Sin embargo, el simple ejercicio de definirlas ha generado varias paradojas. En el presente artículo se definirán las nociones de súper-tarea y ATM de manera exhaustiva y se aclarará qué debe entenderse en un contexto lógico-formal cuando se pregunta por la existencia de un objeto. A partir de la distinción entre posibilidades lógicas y físicas se disolverán las paradojas y se concluirá que las ATMs son posibles y (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Diagonalization & Forcing FLEX: From Cantor to Cohen and Beyond. Learning from Leibniz, Cantor, Turing, Gödel, and Cohen; crawling towards AGI.Elan Moritz - manuscript
    The paper continues my earlier Chat with OpenAI’s ChatGPT with a Focused LLM Experiment (FLEX). The idea is to conduct Large Language Model (LLM) based explorations of certain areas or concepts. The approach is based on crafting initial guiding prompts and then follow up with user prompts based on the LLMs’ responses. The goals include improving understanding of LLM capabilities and their limitations culminating in optimized prompts. The specific subjects explored as research subject matter include a) diagonalization techniques as practiced (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. Ex Machina: Testing Machines for Consciousness and Socio-Relational Machine Ethics.Harrison S. Jackson - 2022 - Journal of Science Fiction and Philosophy 5.
    Ex Machina is a 2014 science-fiction film written and directed by Alex Garland, centered around the creation of a human-like artificial intelligence (AI) named Ava. The plot focuses on testing Ava for consciousness by offering a unique reinterpretation of the Turing Test. The film offers an excellent thought experiment demonstrating the consequences of various approaches to a potentially conscious AI. In this paper, I will argue that intelligence testing has significant epistemological shortcomings that necessitate an ethical approach not reliant (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  34. 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  
     
    Export citation  
     
    Bookmark   1 citation  
  35. (1 other version)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  
  36. 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  
  37. (1 other version)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  
     
    Export citation  
     
    Bookmark  
  38. 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  
  39. 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  
  40. 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  
  41. Computing Machinery and Sexual Difference: The Sexed Presuppositions Underlying the Turing Test.Amy Kind - 2022 - In Keya Maitra & Jennifer McWeeny (eds.), Feminist Philosophy of Mind. New York, NY, United States of America: Oxford University Press, Usa.
    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  
  42. 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  
     
    Export citation  
     
    Bookmark  
  43.  97
    La thèse de Turing physique et l'informatique quantique.Florent Franchette - 2010 - RÉPHA, revue étudiante de philosophie analytique 2:19-24.
    Download  
     
    Export citation  
     
    Bookmark  
  44. 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  
  45. 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  
  46. 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  
  47.  19
    Sulla creatività dei sistemi di calcolo, con una lettura filosofica del problema della fermata di Alan Turing.Michele Pavan - 2023 - «Epekeina. International Journal of Ontology, History and Critics», Vol. 16, No. 1-2 16 (1-2):1-33.
    The main goal of this essay is to demonstrate the creativity of computational systems (both living and non-living) through a philosophical interpretation of Alan Turing's halting theorem. The first part consists of a brief genealogy of studies focused on the analogy between humans and machines, with a specific focus on the issue of creativity. It aims to show how, since the publication of Turing's 1950 paper Computing Machinery and Intelligence, a subjectivist approach has become dominant in these studies—namely, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. 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   1 citation  
  49. (2 other versions)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  
     
    Export citation  
     
    Bookmark   2 citations  
  50. 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 quantum computer. The physical processes (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 959