This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

117 found
Order:
1 — 50 / 117
  1. On Turing Completeness, or Why We Are So Many.Ramón Casares - manuscript
    Why are we so many? Or, in other words, Why is our species so successful? The ultimate cause of our success as species is that we, Homo sapiens, are the first and the only Turing complete species. Turing completeness is the capacity of some hardware to compute by software whatever hardware can compute. -/- To reach the answer, I propose to see evolution and computing from the problem solving point of view. Then, solving more problems is evolutionarily better, computing is (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. Fuzzy Time, From Paradox to Paradox.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 consider (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  3. 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.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. Church's Thesis and its Epistemological Status.Roman Murawski - unknown - Poznan Studies in the Philosophy of the Sciences and the Humanities 98:123-134.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  5. Computability: Gödel, Turing, Church, and Beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - forthcoming - MIT Press.
  6. Explaining Experience In Nature: The Foundations Of Logic And Apprehension.Steven Ericsson-Zenith - forthcoming - Institute for Advanced Science & Engineering.
    At its core this book is concerned with logic and computation with respect to the mathematical characterization of sentient biophysical structure and its behavior. -/- Three related theories are presented: The first of these provides an explanation of how sentient individuals come to be in the world. The second describes how these individuals operate. And the third proposes a method for reasoning about the behavior of individuals in groups. -/- These theories are based upon a new explanation of experience in (...)
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  7. Wittgensteins Diagonal-Argument: Eine Variation auf Cantor und Turing.Juliet Floyd - forthcoming - In Joachim Bromand & Bastian Reichert (eds.), Wittgenstein und die Philosophie der Mathematik. Münster: Mentis Verlag. pp. 167-197.
    A German translation with 2017 postscript of Floyd, Juliet. 2012. "Wittgenstein's Diagonal Argument: A Variation on Cantor and Turing." In Epistemology versus Ontology, Logic, Epistemology: Essays in Honor of Per Martin-Löf, edited by P. Dybjer, S. Lindström, E. Palmgren and G. Sundholm, 25-44. Dordrecht: Springer Science+Business Media. An analysis of philosophical aspects of Turing's diagonal argument in his (136) "On computable numbers, with an application to the Entscheidungsproblem" in relation to Wittgenstein's writings on Turing and Cantor.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  8. Only Human: A Book Review of The Turing Guide. [REVIEW]Bjørn Kjos-Hanssen - forthcoming - Notices of the American Mathematical Society 66 (4).
    This is a review of The Turing Guide (2017), written by Jack Copeland, Jonathan Bowen, Mark Sprevak, Robin Wilson, and others. The review includes a new sociological approach to the problem of computability in physics.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  9. The Church-Turing Thesis and Hyper-Computation.O. Shagrir & I. Pitowsky - forthcoming - Minds and Machines.
  10. Jonathan A. Newman, Gary Varner, and Stefan Linquist. Defending Biodiversity: Environmental Science and Ethics. [REVIEW]John Wiens - 2021 - Environmental Ethics 43 (1):93-96.
  11. Обзор "Внешние границы разума" (The Outer Limits of Reason by Noson Yanofsky 403p (2013) (обзор пересмотрен 2019).Michael Richard Starks - 2020 - In ДОБРО ПОЖАЛОВАТЬ В АД НА НАШЕМ МИРЕ : Дети, Изменение климата, Биткойн, Картели, Китай, Демократия, Разнообразие, Диссигеника, Равенство, Хакеры, Права человека, Ислам, Либерализм, Процветание, Сеть, Хаос, Голод, Болезнь, Насилие, Искусственный интелле. Las Vegas, NV USA: Reality Press. pp. 193-209.
    Я даю подробный обзор "Внешние границы разума" Носон Янофски с единой точки зрения Витгенштейна и эволюционной психологии. Я указываю, что трудности с такими вопросами, как парадокс в языке и математике, неполнота, несоответствие, вычислительность, мозг и вселенная, как компьютеры и т.д., все это возникает из-за неспособности внимательно посмотреть на наше использование языка в соответствующем контексте и, следовательно, неспособность отделить вопросы научного факта от вопросов о том, как работает язык. Я обсуждаю взгляды Витгенштейна на неполноту, последовательность и несоответствие и нерешающость и работу (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. Wolpert, Chaitin and Wittgenstein 不可能性、不完全性、嘘つきパラドックス、 無神論、計算の限界、非量子力学的不確実性原理、そしてコンピューターとして の宇宙-チューリング機械理論の究極の定理 (2019年改訂レビュー).Michael Richard Starks - 2020 - In 地獄へようこそ 赤ちゃん、気候変動、ビットコイン、カルテル、中国、民主主義、多様性、ディスジェニックス、平等、ハッカー、人権、イスラム教、自由主義、繁栄、ウェブ、カオス、飢餓、病気、暴力、人工知能、戦争. Las Vegas,, NV , USA: Reality Press. pp. 173-177.
    私は計算と宇宙の限界に関する最近の議論をコンピュータとして読み、ポリマス物理学者と意思決定理論家デビッド・ウォルパートの驚くべき仕事に関するいくつかのコメントを見つけることを望んでいますが、単一の引用 を見つけていないので、私はこの非常に簡単な要約を提示します。ウォルパートは、計算を行うデバイスから独立し、物理学の法則から独立している推論(計算)の限界に関する驚くべき不可能または不完全な定理(199 2年から2008年のarxiv.org参照)を証明したので、コンピュータ、物理学、人間の行動に適用されます。彼らは、カントールの対角化、嘘つきのパラドックス、ワールドラインを利用して、チューリングマシ ン理論の究極の定理である可能性のあるものを提供し、不可能、不完全性、計算の限界、そしてコンピュータとしての宇宙に関する洞察を提供し、すべての可能な宇宙とすべての存在またはメカニズムを生み出し、とりわけ 非量子機械不確実性原理と単一主義の証明を生み出します。チャイティン、ソロモノフ、コモルガロフ、ヴィトゲンシュタインの古典的な作品と、どのプログラム(したがってデバイスも)が所有するよりも複雑なシーケン ス(またはデバイス)を生成できないという考えには明らかなつながりがあります。この作品の体は、物理的な宇宙よりも複雑な存在はあり得ないので無テズムを意味すると言うかもしれませんし、ヴィトゲンチニアンの観 点から見ると、「より複雑な」は無意味です(満足の条件はありません、すなわち、真実のメーカーやテスト)。「神」(つまり、無限の時間/空間とエネルギーを持つ「デバイス」)でさえ、与えられた「数」が「ランダ ム」であるかどうかを判断したり、与えられた「公式」、定理または「文章」または「デバイス」(これらはすべて複雑な言語ゲームである)が特定の「システム」の一部であることを示す特定の方法を見つけることができ ません。 現代の2つのシス・エムスの見解から人間の行動のための包括的な最新の枠組みを望む人は、私の著書「ルートヴィヒ・ヴィトゲンシュタインとジョン・サールの第2回(2019)における哲学、心理学、ミンと言語の論 理的構造」を参照することができます。私の著作の多くにご興味がある人は、21世紀4日(2019年)の「話す猿--哲学、心理学、科学、宗教、政治」を見ることができます。 .
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  13. のレビュー"「理由の外側の限界"」(The Outer Limits of Reason) by Noson Yanofsky (2019年改訂レビュー).Michael Richard Starks - 2020 - In 地獄へようこそ 赤ちゃん、気候変動、ビットコイン、カルテル、中国、民主主義、多様性、ディスジェニックス、平等、ハッカー、人権、イスラム教、自由主義、繁栄、ウェブ、カオス、飢餓、病気、暴力、人工知能、戦争. Las Vegas, NV , USA: Reality Press. pp. 178-192.
    ノソン・ヤノフスキーの「理性の外側の限界」を、ウィトゲンシュタインと進化心理学の統一的な視点から詳しくレビューします。私は、言語や数学のパラドックス、不完全さ、デデシッド性、コンピュータとしての脳、宇 宙などの問題の難しさは、すべて適切な文脈での言語の使用を注意深く見なさなかったことから生じるため、科学的事実の問題を言語の仕組みの問題から切り離すことができなかったことを示しています。私は、不完全さ、 パラタンシ、不整合性に関するヴィトゲンシュタインの見解と、計算の限界に関するウォルパートの仕事について議論します。要約すると:ブルックリンによると宇宙---良い科学、それほど良い哲学ではありません。 現代の2つのシス・エムスの見解から人間の行動のための包括的な最新の枠組みを望む人は、私の著書「ルートヴィヒ・ヴィトゲンシュタインとジョン・サールの第2回(2019)における哲学、心理学、ミンと言語の論 理的構造」を参照することができます。私の著作の多くにご興味がある人は、運命の惑星における「話す猿--哲学、心理学、科学、宗教、政治―記事とレビュー2006-2019 第3回(2019)」と21世紀4日(2019年)の自殺ユートピア妄想st Century 4th ed (2019)などを見ることができます。 .
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  14. 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 (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  15. 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, (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  16. Wolpert, Chaitin и Wittgenstein о невозможности, неполноте, парадоксе лжецов, теизм, границах вычислений, принципе неквантовой механической неопределенности и вселенной как компьютер – конечной теорете в Тuring машин Тьюринга (пересмотренный 2019).Michael Richard Starks - 2020 - In ДОБРО ПОЖАЛОВАТЬ В АД НА НАШЕМ МИРЕ : Дети, Изменение климата, Биткойн, Картели, Китай, Демократия, Разнообразие, Диссигеника, Равенство, Хакеры, Права человека, Ислам, Либерализм, Процветание, Сеть, Хаос, Голод, Болезнь, Насилие, Искусственный интелле. Las Vegas, NV USA: Reality Press. pp. 187-192.
    Я читал много недавних дискуссий о границах вычислений и Вселенной, как компьютер, надеясь найти некоторые комментарии по удивительной работы физика полимата и теоретик решений Дэвид Вольперт, но не нашли ни одной цитаты, и поэтому я представляю это очень краткое резюме. Вольперт доказал некоторые потрясающие невозможности или теоремы неполноты (1992 до 2008-см arxiv dot org) на пределы выводов (вычисления), которые настолько общие они не зависят от устройства делать вычисления, и даже независимо от законов физики, поэтому они применяются через компьютеры, физика, и (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17. 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)를 입증했습니다. 그들은 캔터의 대각선화, 거짓말쟁이 역설 및 세계관을 사용하여 튜링 머신 이론의 궁극적 인 정리가 될 (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18. Quantum Computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.
    Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  19. Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how language works. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  20. 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, (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  21. Wolpert, Chaitin e Wittgenstein em impossibilidade, incompletude, o paradoxo do mentiroso, o teísmo, os limites da computação, um princípio de incerteza mecânica não quântica e o universo como computador — o teorema final na teoria da máquina de Turing (revisado 2019).Michael Richard Starks - 2019 - In Delírios Utópicos Suicidas no Século XXI Filosofia, Natureza Humana e o Colapso da Civilization- Artigos e Comentários 2006-2019 5ª edição. Las Vegas, NV USA: Reality Press. pp. 183-187.
    Eu li muitas discussões recentes sobre os limites da computação e do universo como computador, na esperança de encontrar alguns comentários sobre o trabalho surpreendente do físico polimatemático e teórico da decisão David Wolpert, mas não encontrei uma única citação e assim que eu apresento este muito breve Resumo. Wolpert provou alguma impossibilidade impressionante ou teoremas da incompletude (1992 a 2008-Veja arxiv dot org) nos limites à inferência (computação) que são tão gerais que são independentes do dispositivo que faz a (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22. Wolpert, Chaitin y Wittgenstein sobre la imposibilidad, la incompletitud, la paradoja mentirosa, el teísmo, los límites de la computación, un principio de incertidumbre mecánica no cuántica y el universo como computadora, el teorema definitivo en la teoría de la máquina de Turing (revisado en 2019).Michael Richard Starks - 2019 - In Delirios Utópicos Suicidas en el Siglo 21 La filosofía, la naturaleza humana y el colapso de la civilización Artículos y reseñas 2006-2019 4a Edición. Las Vegas, NV USA: Reality Press. pp. 278-282.
    He leído muchas discusiones recientes sobre los límites de la computación y el universo como computadora, con la esperanza de encontrar algunos comentarios sobre el increíble trabajo del físico polimatemático y teórico de la decisión David Wolpert pero no han encontrado una sola citación y así que presento esta muy breve Resumen. Wolpert demostró algunos teoremas sorprendentes de imposibilidad o incompletos (1992 a 2008-ver arxiv dot org) en los límites de la inferencia (computación) que son tan generales que son independientes (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  23. Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer.Michael Cuffaro - 2018 - In Sven Hansson (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Springer. pp. 253-282.
    Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding our practical limits. In this chapter I argue that the science of \emph{quantum computing} illuminates complexity theory by emphasising that its fundamental concepts are not model-independent, but that this does not, as some suggest, force us to radically revise the foundations of the theory. For model-independence (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24. 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 a personal point of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25. Review of Computability: Turing, Gödel, Church, and Beyond. [REVIEW]Andrew Arana - 2015 - Notre Dame Philosophical Reviews 3 (20).
  26. Counting Steps: A Finitist Interpretation of Objective Probability in Physics.Amit Hagar & Giuseppe Sergioli - 2015 - Epistemologia 37 (2):262-275.
    We propose a new interpretation of objective deterministic chances in statistical physics based on physical computational complexity. This notion applies to a single physical system (be it an experimental set--up in the lab, or a subsystem of the universe), and quantifies (1) the difficulty to realize a physical state given another, (2) the 'distance' (in terms of physical resources) from a physical state to another, and (3) the size of the set of time--complexity functions that are compatible with the physical (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. A Quantum-Information-Theoretic Complement to a General-Relativistic Implementation of a Beyond-Turing Computer.Christian Wüthrich - 2015 - Synthese 192 (7):1989-2008.
    There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, Istvan Nemeti and Gyula David have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  28. B. Jack Copeland, Carl J. Posy, and Oron Shagrir, Eds, Computability: Turing, Gödel, Church, and Beyond. Cambridge, Mass.: MIT Press, 2013. ISBN 978-0-262-01899-9. Pp. X + 362. [REVIEW]Roy T. Cook - 2014 - Philosophia Mathematica 22 (3):412-413.
  29. Отвъд машината на Тюринг: квантовият компютър.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 on how quantum computer might (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  30. The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem.Saul A. Kripke - 2013 - In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Turing, Gödel, Church, and Beyond. MIT Press.
    Traditionally, many writers, following Kleene (1952), thought of the Church-Turing thesis as unprovable by its nature but having various strong arguments in its favor, including Turing’s analysis of human computation. More recently, the beauty, power, and obvious fundamental importance of this analysis, what Turing (1936) calls “argument I,” has led some writers to give an almost exclusive emphasis on this argument as the unique justification for the Church-Turing thesis. In this chapter I advocate an alternative justification, essentially presupposed by Turing (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  31. What is a Digital State?Vincent C. Müller - 2013 - In Mark J. Bishop & Yasemin Erden (eds.), The Scandal of Computation - What is Computation? - AISB Convention 2013. AISB. pp. 11-16.
    There is much discussion about whether the human mind is a computer, whether the human brain could be emulated on a computer, and whether at all physical entities are computers (pancomputationalism). These discussions, and others, require criteria for what is digital. I propose that a state is digital if and only if it is a token of a type that serves a particular function - typically a representational function for the system. This proposal is made on a syntactic level, assuming (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32. 20 Years After The Embodied Mind - Why is Cognitivism Alive and Kicking?Vincent C. Müller - 2013 - In Blay Whitby & Joel Parthmore (eds.), Re-Conceptualizing Mental "Illness": The View from Enactivist Philosophy and Cognitive Science - AISB Convention 2013. AISB. pp. 47-49.
    I want to suggest that the major influence of classical arguments for embodiment like "The Embodied Mind" by Varela, Thomson & Rosch (1991) has been a changing of positions rather than a refutation: Cognitivism has found ways to retreat and regroup at positions that have better fortification, especially when it concerns theses about artificial intelligence or artificial cognitive systems. For example: a) Agent-based cognitivism' that understands humans as taking in representations of the world, doing rule-based processing and then acting on (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33. A Note on Ramsey Theorems and Turing Jumps.Lorenzo Carlucci & Konrad Zdanowski - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 89--95.
  34. Carnap, Turing and Wittgenstein : Contrasting Notions of Analysis.Juliet Floyd - 2012 - In Pierre Wagner (ed.), Carnap's Ideal of Explication and Naturalism. Palgrave-Macmillan.
  35. What is an Algorithm.Yuri Gurevich - 2012 - Lecture Notes in Computer Science.
  36. Les deux formes de la thèse de Church-Turing et l'épistémologie du calcul.Maël Pégny - 2012 - Philosophia Scientiae 16 (16-3):39-67.
    La thèse de Church-Turing stipule que toute fonction calculable est calculable par une machine de Turing. En distinguant, à la suite de nombreux auteurs, une forme algorithmique de la thèse de Church-Turing portant sur les fonctions calculables par un algorithme d’une forme empirique de cette même thèse, portant sur les fonctions calculables par une machine, il devient possible de poser une nouvelle question : les limites empiriques du calcul sont-elles identiques aux limites des algorithmes ? Ou existe-t-il un moyen empirique (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  37. Les Deux Formes de la Thèse de Church-Turing Et L’Épistémologie du Calcul.Maël Pégny - 2012 - Philosophia Scientae 16:39-67.
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  38. Cleland on Church's Thesis and the Limits of Computation.Clayton Peterson & François Lepage - 2012 - Philosophia Scientiae 16 (16-3):69-85.
    Cet article se veut une critique de la thèse défendue par [Cleland 1993], laquelle soutient que la thèse de Church doit être rejetée puisque les limites du calcul dépendent de la structure physique du monde. Dans un premier temps, nous offrons un (très) bref aperçu de la thèse de Church puis nous présentons l argument de Cleland. Par la suite, nous proposons une analyse critique de son argument, ce qui nous amènera à faire quelques distinctions conceptuelles par rapport aux notions (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39. Is Turing's Thesis the Consequence of a More General Physical Principle?Matthew P. Szudzik - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 714--722.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Philosophy of Mind Is (in Part) Philosophy of Computer Science.Darren Abramson - 2011 - Minds and Machines 21 (2):203-219.
    In this paper I argue that whether or not a computer can be built that passes the Turing test is a central question in the philosophy of mind. Then I show that the possibility of building such a computer depends on open questions in the philosophy of computer science: the physical Church-Turing thesis and the extended Church-Turing thesis. I use the link between the issues identified in philosophy of mind and philosophy of computer science to respond to a prominent argument (...)
    Remove from this list   Direct download (14 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  41. 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 such (...)
    Remove from this list   Direct download (11 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42. The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
    This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  43. How Not To Use the Church-Turing Thesis Against Platonism.R. Urbaniak - 2011 - Philosophia Mathematica 19 (1):74-89.
    Olszewski claims that the Church-Turing thesis can be used in an argument against platonism in philosophy of mathematics. The key step of his argument employs an example of a supposedly effectively computable but not Turing-computable function. I argue that the process he describes is not an effective computation, and that the argument relies on the illegitimate conflation of effective computability with there being a way to find out . ‘Ah, but,’ you say, ‘what’s the use of its being right twice (...)
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  44. 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 object of the study) by (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  45. Hyperloops Do Not Threaten the Notion of an Effective Procedure.Tim Button - 2009 - Lecture Notes in Computer Science 5635:68-78.
    This paper develops my (BJPS 2009) criticisms of the philosophical significance of a certain sort of infinitary computational process, a hyperloop. I start by considering whether hyperloops suggest that "effectively computable" is vague (in some sense). I then consider and criticise two arguments by Hogarth, who maintains that hyperloops undermine the very idea of effective computability. I conclude that hyperloops, on their own, cannot threaten the notion of an effective procedure.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  46. SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
    Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...)
    Remove from this list   Direct download (10 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  47. The Abductive Loop: Tracking Irrational Sets.Tom Addis, Jan Townsend Addis, Dave Billinge, David Gooding & Bart-Floris Visscher - 2008 - Foundations of Science 13 (1):5-16.
    We argue from the Church-Turing thesis (Kleene Mathematical logic. New York: Wiley 1967) that a program can be considered as equivalent to a formal language similar to predicate calculus where predicates can be taken as functions. We can relate such a calculus to Wittgenstein’s first major work, the Tractatus, and use the Tractatus and its theses as a model of the formal classical definition of a computer program. However, Wittgenstein found flaws in his initial great work and he explored these (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48. The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
    There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be carried out by a Turing machine. The Church-Turing thesis is often misunderstood, particularly in recent writing in the philosophy of mind.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   43 citations  
  49. An Analysis of the Criteria for Evaluating Adequate Theories of Computation.Nir Fresco - 2008 - Minds and Machines 18 (3):379-401.
    This paper deals with the question: What are the criteria that an adequate theory of computation has to meet? 1. Smith's answer: it has to meet the empirical criterion (i.e. doing justice to computational practice), the conceptual criterion (i.e. explaining all the underlying concepts) and the cognitive criterion (i.e. providing solid grounds for computationalism). 2. Piccinini's answer: it has to meet the objectivity criterion (i.e. identifying computation as a matter of fact), the explanation criterion (i.e. explaining the computer's behaviour), the (...)
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50. The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis. [REVIEW]Dina Goldin & Peter Wegner - 2008 - Minds and Machines 18 (1):17-38.
    The classical view of computing positions computation as a closed-box transformation of inputs (rational numbers or finite strings) to outputs. According to the interactive view of computing, computation is an ongoing interactive process rather than a function-based transformation of an input to an output. Specifically, communication with the outside world happens during the computation, not before or after it. This approach radically changes our understanding of what is computation and how it is modeled. The acceptance of interaction as a new (...)
    Remove from this list   Direct download (14 more)  
     
    Export citation  
     
    Bookmark   4 citations  
1 — 50 / 117