View topic on PhilPapers for more information
Related categories

154 found
Order:
More results on PhilPapers
1 — 50 / 154
Material to categorize
  1. Lower and Upper Estimates of the Quantity of Algebraic Numbers.Yaroslav Sergeyev - 2023 - Mediterranian Journal of Mathematics 20:12.
    It is well known that the set of algebraic numbers (let us call it A) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using ①-based infinite numbers is applied to measure the set A (where the number ① is called grossone). Our interest to this methodology is explained by the fact that in certain cases where cardinals allow one to say only whether a set is countable (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Link Uncertainty, Implementation, and ML Opacity: A Reply to Tamir and Shech.Emily Sullivan - 2022 - In Insa Lawler, Kareem Khalifa & Elay Shech (eds.), Scientific Understanding and Representation. Routledge. pp. 341-345.
    This chapter responds to Michael Tamir and Elay Shech’s chapter “Understanding from Deep Learning Models in Context.”.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Simulating Halt Decider Applied to the Halting Theorem.P. Olcott - manuscript
    The novel concept of a simulating halt decider enables C function H to correctly determine the halt status of C function D that implements the halting theorem's "impossible" input. When D is correctly simulated by H it remains stuck in recursive simulation until H aborts this simulation. D cannot do the opposite of the return value from H because this return value is unreachable by every simulated D. This same result is derived in Turing machine based proofs.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Bold because humble, humble because bold. Yann LeCun's path.Giovanni Landi - 2022 - Www.Intelligenzaartificialecomefilosofia.Com.
    Some philosophical considerations over Yann LeCun’s position paper “A Path Towards Autonomous Machine Intelligence”.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Understanding from Machine Learning Models.Emily Sullivan - 2022 - British Journal for the Philosophy of Science 73 (1):109-133.
    Simple idealized models seem to provide more understanding than opaque, complex, and hyper-realistic models. However, an increasing number of scientists are going in the opposite direction by utilizing opaque machine learning models to make predictions and draw inferences, suggesting that scientists are opting for models that have less potential for understanding. Are scientists trading understanding for some other epistemic or pragmatic good when they choose a machine learning model? Or are the assumptions behind why minimal models provide understanding misguided? In (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   30 citations  
  6. Halting problem undecidability and infinitely nested simulation (V2).P. Olcott - manuscript
    The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Towards a Theory of Computation similar to some other scientific theories.Antonino Drago - manuscript
    At first sight the Theory of Computation i) relies on a kind of mathematics based on the notion of potential infinity; ii) its theoretical organization is irreducible to an axiomatic one; rather it is organized in order to solve a problem: “What is a computation?”; iii) it makes essential use of doubly negated propositions of non-classical logic, in particular in the word expressions of the Church-Turing’s thesis; iv) its arguments include ad absurdum proofs. Under such aspects, it is like many (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Квантовият компютър: квантовите ординали и типовете алгоритмична неразрешимост.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 .
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Absolutely No Free Lunches!Gordon Belot - forthcoming - Theoretical Computer Science.
    This paper is concerned with learners who aim to learn patterns in infinite binary sequences: shown longer and longer initial segments of a binary sequence, they either attempt to predict whether the next bit will be a 0 or will be a 1 or they issue forecast probabilities for these events. Several variants of this problem are considered. In each case, a no-free-lunch result of the following form is established: the problem of learning is a formidably difficult one, in that (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  10. Why Be Random?Thomas Icard - 2021 - Mind 130 (517):111-139.
    When does it make sense to act randomly? A persuasive argument from Bayesian decision theory legitimizes randomization essentially only in tie-breaking situations. Rational behaviour in humans, non-human animals, and artificial agents, however, often seems indeterminate, even random. Moreover, rationales for randomized acts have been offered in a number of disciplines, including game theory, experimental design, and machine learning. A common way of accommodating some of these observations is by appeal to a decision-maker’s bounded computational resources. Making this suggestion both precise (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  11. Un Sistema di Creatività Computazionale basato su Logiche Non Monotòne per la Generazione di Nuovi Personaggi/Storie/Format in Ambienti Multi-Mediali.Antonio Lieto - forthcoming - In Proceedings of Ital-IA. Rome, Metropolitan City of Rome, Italy: pp. 123-135.
    In questo contributo descriviamo un sistema di creatività computazionale in grado di generare automaticamente nuovi concetti utilizzando una logica descrittiva non monotòna che integra tre ingredienti principali: una logica descrittiva della tipicalità, una estensione probabilistica basata sulla semantica distribuita nota come DISPONTE, e una euristica di ispirazione cognitiva per la combinazione di più concetti. Una delle applicazioni principali del sistema riguarda il campo della creatività computazionale e, più specificatamente, il suo utilizzo come sistema di supporto alla creatività in ambito mediale. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems.Yaroslav Sergeyev - 2017 - EMS Surveys in Mathematical Sciences 4 (2):219–320.
    In this survey, a recent computational methodology paying a special attention to the separation of mathematical objects from numeral systems involved in their representation is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework in all the situations requiring these notions. The methodology does not contradict Cantor’s and non-standard analysis views and is based on the Euclid’s Common Notion no. 5 “The whole is greater than the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Physical computation: a mechanistic account. [REVIEW]Joe Dewhurst - 2016 - Philosophical Psychology 29 (5):795-797.
    Physical Computation is the summation of Piccinini’s work on computation and mechanistic explanation over the past decade. It draws together material from papers published during that time, but also provides additional clarifications and restructuring that make this the definitive presentation of his mechanistic account of physical computation. This review will first give a brief summary of the account that Piccinini defends, followed by a chapter-by-chapter overview of the book, before finally discussing one aspect of the account in more critical detail.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  14. Computing and philosophy: Selected papers from IACAP 2014.Vincent C. Müller (ed.) - 2016 - Cham: Springer.
    This volume offers very selected papers from the 2014 conference of the “International Association for Computing and Philosophy” (IACAP) - a conference tradition of 28 years. - - - Table of Contents - 0 Vincent C. Müller: - Editorial - 1) Philosophy of computing - 1 Çem Bozsahin: - What is a computational constraint? - 2 Joe Dewhurst: - Computing Mechanisms and Autopoietic Systems - 3 Vincenzo Fano, Pierluigi Graziani, Roberto Macrelli and Gino Tarozzi: - Are Gandy Machines really local? (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. What is morphological computation? On how the body contributes to cognition and control.Vincent C. Müller & Matej Hoffmann - 2017 - Artificial Life 23 (1):1-24.
    The contribution of the body to cognition and control in natural and artificial agents is increasingly described as “off-loading computation from the brain to the body”, where the body is said to perform “morphological computation”. Our investigation of four characteristic cases of morphological computation in animals and robots shows that the ‘off-loading’ perspective is misleading. Actually, the contribution of body morphology to cognition and control is rarely computational, in any useful sense of the word. We thus distinguish (1) morphology that (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  16. Variable Binding Term Operators.John Corcoran, William Hatcher & John Herring - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (12):177-182.
    Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  17. Susan Stuart & Gordana Dodig Crnkovic : 'Computation, Information, Cognition: The Nexus and the Liminal'. [REVIEW]Vincent C. Müller - 2009 - Cybernetics and Human Knowing 16 (3-4):201-203.
    Review of: "Computation, Information, Cognition: The Nexus and the Liminal", Ed. Susan Stuart & Gordana Dodig Crnkovic, Newcastle: Cambridge Scholars Publishing, September 2007, xxiv+340pp, ISBN: 9781847180902, Hardback: £39.99, $79.99 ---- Are you a computer? Is your cat a computer? A single biological cell in your stomach, perhaps? And your desk? You do not think so? Well, the authors of this book suggest that you think again. They propose a computational turn, a turn towards computational explanation and towards the explanation of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. Representation in digital systems.Vincent C. Müller - 2008 - In Adam Briggle, Katinka Waelbers & Brey Philip (eds.), Current Issues in Computing and Philosophy. IOS Press. pp. 116-121.
    Cognition is commonly taken to be computational manipulation of representations. These representations are assumed to be digital, but it is not usually specified what that means and what relevance it has for the theory. I propose a specification for being a digital state in a digital system, especially a digital computational system. The specification shows that identification of digital states requires functional directedness, either for someone or for the system of which it is a part. In the case or digital (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
The Church-Turing Thesis
  1. Turing vs. super-Turing: a defence of the Church-Turing thesis.Luciano Floridi - 1999 - In Philosophy and computing: an introduction. Oxford:
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  2. 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   Download  
     
    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   Download  
     
    Export citation  
     
    Bookmark  
  4. 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   Download  
     
    Export citation  
     
    Bookmark  
  5. のレビュー"「理由の外側の限界"」(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   Download  
     
    Export citation  
     
    Bookmark  
  6. 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   Download  
     
    Export citation  
     
    Bookmark  
  7. 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   Download  
     
    Export citation  
     
    Bookmark  
  8. Обзор "Внешние границы разума" (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   Download  
     
    Export citation  
     
    Bookmark  
  9. 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   Download  
     
    Export citation  
     
    Bookmark  
  10. 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   Download  
     
    Export citation  
     
    Bookmark  
  11. Отвъд машината на Тюринг: квантовият компютър.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   Download  
     
    Export citation  
     
    Bookmark  
  12. 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   Download  
     
    Export citation  
     
    Bookmark  
  13. 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   Download  
     
    Export citation  
     
    Bookmark  
  14. 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   Download  
     
    Export citation  
     
    Bookmark  
  15. 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   Download  
     
    Export citation  
     
    Bookmark  
  16. 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   Download  
     
    Export citation  
     
    Bookmark  
  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 a personal point of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  18. Modality and Hyperintensionality in Mathematics.Hasen Khudairi - manuscript
    This paper aims to contribute to the analysis of the nature of mathematical modality, and to the applications of the latter to unrestricted quantification and absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. 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   Download  
     
    Export citation  
     
    Bookmark  
  20. 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   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21. Computability in Quantum Mechanics.Wayne C. Myrvold - 1995 - In Werner De Pauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.), Vienna Circle Institute Yearbook. Kluwer Academic Publishers. pp. 33-46.
    In this paper, the issues of computability and constructivity in the mathematics of physics are discussed. The sorts of questions to be addressed are those which might be expressed, roughly, as: Are the mathematical foundations of our current theories unavoidably non-constructive: or, Are the laws of physics computable?
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  22. The Decision Problem for Entanglement.Wayne C. Myrvold - 1997 - In Robert S. Cohen, Michael Horne & John Stachel (eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies for Abner Shimony. Kluwer Academic Publishers. pp. 177--190.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  23. 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   Download  
     
    Export citation  
     
    Bookmark  
  24. 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   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  25. 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   Download  
     
    Export citation  
     
    Bookmark   2 citations  
Algorithmic Complexity
  1. Strengthening Weak Emergence.Nora Berenstain - 2020 - Erkenntnis 87 (5):2457-2474.
    Bedau's influential (1997) account analyzes weak emergence in terms of the non-derivability of a system’s macrostates from its microstates except by simulation. I offer an improved version of Bedau’s account of weak emergence in light of insights from information theory. Non-derivability alone does not guarantee that a system’s macrostates are weakly emergent. Rather, it is non-derivability plus the algorithmic compressibility of the system’s macrostates that makes them weakly emergent. I argue that the resulting information-theoretic picture provides a metaphysical account of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. A Dilemma for Solomonoff Prediction.Sven Neth - forthcoming - Philosophy of Science.
    The framework of Solomonoff prediction assigns prior probability to hypotheses inversely proportional to their Kolmogorov complexity. There are two well-known problems. First, the Solomonoff prior is relative to a choice of Universal Turing machine. Second, the Solomonoff prior is not computable. However, there are responses to both problems. Different Solomonoff priors converge with more and more data. Further, there are computable approximations to the Solomonoff prior. I argue that there is a tension between these two responses. This is because computable (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. The Substrate-Prior of Consciousness.Gabriel Leuenberger -
    Given functionally equivalent minds, how does the expected quantity of their conscious experience differ across different substrates and how could we calculate this? We argue that a realistic digital brain emulation would be orders of magnitude less conscious than a real biological brain. On the other hand, a mind running on neuromorphic hardware or a quantum computer could in principle be more conscious than than a biological brain.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Real patterns and indispensability.Abel Suñé & Manolo Martínez - 2021 - Synthese 198 (5):4315-4330.
    While scientific inquiry crucially relies on the extraction of patterns from data, we still have a far from perfect understanding of the metaphysics of patterns—and, in particular, of what makes a pattern real. In this paper we derive a criterion of real-patternhood from the notion of conditional Kolmogorov complexity. The resulting account belongs to the philosophical tradition, initiated by Dennett :27–51, 1991), that links real-patternhood to data compressibility, but is simpler and formally more perspicuous than other proposals previously defended in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  5. Composition as pattern.Steve Petersen - 2019 - Philosophical Studies 176 (5):1119-1139.
    I argue for patternism, a new answer to the question of when some objects compose a whole. None of the standard principles of composition comfortably capture our natural judgments, such as that my cat exists and my table exists, but there is nothing wholly composed of them. Patternism holds, very roughly, that some things compose a whole whenever together they form a “real pattern”. Plausibly we are inclined to acknowledge the existence of my cat and my table but not of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   8 citations  
  6. Toward an algorithmic metaphysics.Steve Petersen - 2013 - In David Dowe (ed.), Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence. Springer. pp. 306-317.
    There are writers in both metaphysics and algorithmic information theory (AIT) who seem to think that the latter could provide a formal theory of the former. This paper is intended as a step in that direction. It demonstrates how AIT might be used to define basic metaphysical notions such as *object* and *property* for a simple, idealized world. The extent to which these definitions capture intuitions about the metaphysics of the simple world, times the extent to which we think the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  7. God is Random: A Novel Argument for the Existence of God.Serkan Zorba - 2016 - European Journal of Science and Theology 12 (1):51-67.
    Applying the concepts of Kolmogorov-Chaitin complexity and Turing’s uncomputability from the computability and algorithmic information theories to the irreducible and incomputable randomness of quantum mechanics, a novel argument for the existence of God is presented. Concepts of ‘transintelligence’ and ‘transcausality’ are introduced, and from them, it is posited that our universe must be epistemologically and ontologically an open universe. The proposed idea also proffers a new perspective on the nonlocal nature and the infamous wave-function-collapse problem of quantum mechanics.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 154