Results for 'Church-Turing thesis,'

962 found
Order:
  1. SAD computers and two versions of the ChurchTuring 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 ChurchTuring 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 ChurchTuring Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  2. Turing vs. super-Turing: a defence of the Church-Turing thesis.Luciano Floridi - 1999 - In Philosophy and computing: an introduction. Routledge.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  3.  88
    Is Complexity Important for Philosophy of Mind?Kristina Šekrst & Sandro Skansi - manuscript
    Computational complexity has often been ignored in the philosophy of mind, in philosophical artificial intelligence studies. The purpose of this paper is threefold. First and foremost, to show the importance of complexity rather than computability in philosophical and AI problems. Second, to rephrase the notion of computability in terms of solvability, i.e., treating computability as non-sufficient for establishing intelligence. The Church-Turing thesis is therefore revisited and rephrased in order to capture the ontological background of spatial and temporal complexity. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  5. Effective Procedures.Nathan Salmon - 2023 - Philosophies 8 (2):27.
    This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the ChurchTuring thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  7. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  8. (1 other version)The Significance of Evidence-based Reasoning for Mathematics, Mathematics Education, Philosophy and the Natural Sciences.Bhupinder Singh Anand - forthcoming
    In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. The Decision Problem for Effective Procedures.Nathan Salmón - 2023 - Logica Universalis 17 (2):161-174.
    The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the ChurchTuring thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10. 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? (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.
    I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  12. Effective Physical Processes and Active Information in Quantum Computing.Ignazio Licata - 2007 - Quantum Biosystems 1 (1):51-65.
    The recent debate on hypercomputation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics.We propose here the idea of “effective physical process” as the essentially physical notion of computation. By using the Bohm and Hiley active information concept we analyze the differences between the standard form (quantum gates) and the non-standard one (adiabatic and morphogenetic) of Quantum Computing, and we point out how its Super-Turing potentialities derive from (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Modality and Hyperintensionality in Mathematics.David Elohim - manuscript
    This paper aims to contribute to the analysis of the nature of mathematical modality and hyperintensionality, and to the applications of the latter to 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 priority (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. Consistency Problem and “Unexpected Hanging Paradox” (An answering to P=NP Problem).Farzad Didehvar - unknown
    Abstract The Theory of Computation in its existed form is based on ChurchTuring Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.
    Download  
     
    Export citation  
     
    Bookmark  
  15. 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.
    Download  
     
    Export citation  
     
    Bookmark  
  16. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17.  73
    Why there can be no mathematical or meta-mathematical proof of consistency for ZF.Bhupinder Singh Anand - manuscript
    In the first part of this investigation we highlight two, seemingly irreconcilable, beliefs that suggest an impending crisis in the teaching, research, and practice of—primarily state-supported—mathematics: (a) the belief, with increasing, essentially faith-based, conviction and authority amongst academics that first-order Set Theory can be treated as the lingua franca of mathematics, since its theorems—even if unfalsifiable—can be treated as ‘knowledge’ because they are finite proof sequences which are entailed finitarily by self-evidently Justified True Beliefs; and (b) the slowly emerging, but (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. (1 other version)Implications of computer science theory for the simulation hypothesis.David Wolpert - manuscript
    Download  
     
    Export citation  
     
    Bookmark  
  19. Arithmetic logical Irreversibility and the Halting Problem (Revised and Fixed version).Yair Lapin - manuscript
    The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Квантовият компютър: квантовите ординали и типовете алгоритмична неразрешимост.Vasil Penchev - 2005 - Philosophical Alternatives 14 (6):59-71.
    A definition of quantum computer is supposed: as a countable set of Turing machines on the ground of: quantum parallelism, reversibility, entanglement. Qubit is the set of all the i–th binary location cells transforming in parallel by unitary matrices. The Church thesis is suggested in the form relevat to quantum computer. The notion of the non–finite (but not infinite) potency of a set is introduced .
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21. Should CSR Give Atheists Epistemic Assurance? On Beer-Goggles, BFFs, and Skepticism Regarding Religious Beliefs.Justin L. Barrett & Ian M. Church - 2013 - The Monist 96 (3):311-324.
    Recent work in cognitive science of religion (CSR) is beginning to converge on a very interesting thesis—that, given the ordinary features of human minds operating in typical human environments, we are naturally disposed to believe in the existence of gods, among other religious ideas (e.g., seeAtran [2002], Barrett [2004; 2012], Bering [2011], Boyer [2001], Guthrie [1993], McCauley [2011], Pyysiäinen [2004; 2009]). In this paper, we explore whether such a discovery ultimately helps or hurts the atheist position—whether, for example, it lends (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  22. 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 a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. Gödel Incompleteness and Turing Completeness.Ramón Casares - manuscript
    Following Post program, we will propose a linguistic and empirical interpretation of Gödel’s incompleteness theorem and related ones on unsolvability by Church and Turing. All these theorems use the diagonal argument by Cantor in order to find limitations in finitary systems, as human language, which can make “infinite use of finite means”. The linguistic version of the incompleteness theorem says that every Turing complete language is Gödel incomplete. We conclude that the incompleteness and unsolvability theorems find limitations (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. El infinito y el continuo en el sistema numérico.Eduardo Dib - 1995 - Dissertation, Universidad Nacional de Rio Cuarto
    This monography provides an overview of the conceptual developments that leads from the traditional views of infinite (and their paradoxes) to the contemporary view in which those old paradoxes are solved but new problems arise. Also a particular insight in the problem of continuity is given, followed by applications in theory of computability.
    Download  
     
    Export citation  
     
    Bookmark  
  25. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  26. Philosophical and methodological foundations of post-Turing intelligent robotics.Albert Efimov - 2021 - Dissertation, Institute of Philosophy Russian Academy of Science
    This is PhD thesis submitted to Institute Philosophy of Russian Academy of Science in March 2021.
    Download  
     
    Export citation  
     
    Bookmark  
  27. (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  
  28. Confusion in the Bishop’s Church.Jan Heylen - 2023 - Philosophia 51 (4):1993-2003.
    Kearns (2021) reconstructs Berkeley’s (1713) Master Argument as a formally valid argument against the Materialist Thesis, with the key premise the Distinct Conceivability Thesis, namely the thesis that truths about sensible objects having or lacking thinkable qualities are (distinctly) conceivable and as its conclusion that all sensible objects are conceived. It will be shown that Distinct Conceivability Thesis entails the Reduction Thesis, which states that de dicto propositional (ordinary or distinct) conceivability reduces to de re propositional (ordinary or distinct) conceivability. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. The Shadow of God in the Garden of the Philosopher. The Parc de La Villette in Paris in the context of philosophy of chôra. Part IV: Other Church / Church of Otherness.Cezary Wąs - 2019 - Quart. Kwartalnik Instytutu Historii Sztuki Uniwersytetu Wrocławskiego 3 (53):80-113.
    In the texts that presented the theoretical assumptions of the Parc de La Villette, Bernard Tschumi used a large number of terms that contradicted not only the traditional principles of composing architecture, but also negated the rules of social order and the foundations of Western metaphysics. Tschumi’s statements, which are a continuation of his leftist political fascinations from the May 1968 revolution, as well as his interest in the philosophy of French poststructuralism and his collaboration with Jacques Derrida, prove that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. Pensiero e calcolo: indagine su formalismo e riduzionismo nelle scienze cognitive tra Turing, Gödel e Intelligenza Artificiale.Alessio Donvito - 2023 - Dissertation, Università Degli Studi di Bari Aldo Moro
    Download  
     
    Export citation  
     
    Bookmark  
  31. An Evolutionary Argument for a Self-Explanatory, Benevolent Metaphysics.Ward Blondé - 2015 - Symposion: Theoretical and Applied Inquiries in Philosophy and Social Sciences 2 (2):143-166.
    In this paper, a metaphysics is proposed that includes everything that can be represented by a well-founded multiset. It is shown that this metaphysics, apart from being self-explanatory, is also benevolent. Paradoxically, it turns out that the probability that we were born in another life than our own is zero. More insights are gained by inducing properties from a metaphysics that is not self-explanatory. In particular, digital metaphysics is analyzed, which claims that only computable things exist. First of all, it (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  32. Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
    If the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible machines whose powers exceed the ChurchTuring limit (e.g. accelerating Turing machines). Some of these supermachines realize superminds. Superminds perform cognitive supertasks. Their thoughts are formed in infinitary languages. They perceive and manipulate the infinite detail (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  33. Factive knowability and the problem of possible omniscience.Jan Heylen - 2020 - Philosophical Studies 177 (1):65-87.
    Famously, the Church–Fitch paradox of knowability is a deductive argument from the thesis that all truths are knowable to the conclusion that all truths are known. In this argument, knowability is analyzed in terms of having the possibility to know. Several philosophers have objected to this analysis, because it turns knowability into a nonfactive notion. In addition, they claim that, if the knowability thesis is reformulated with the help of factive concepts of knowability, then omniscience can be avoided. In (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  34. A dialogue concerning two world systems: Info-computational vs. mechanistic.Gordana Dodig-Crnkovic & Vincent C. Müller - 2011 - In Gordana Dodig Crnkovic & Mark Burgin (eds.), Information and computation: Essays on scientific and philosophical understanding of foundations of information and computation. World Scientific. pp. 149-184.
    The dialogue develops arguments for and against a broad new world system - info-computationalist naturalism - that is supposed to overcome the traditional mechanistic view. It would make the older mechanistic view into a special case of the new general info-computationalist framework (rather like Euclidian geometry remains valid inside a broader notion of geometry). We primarily discuss what the info-computational paradigm would mean, especially its pancomputationalist component. This includes the requirements for a the new generalized notion of computing that would (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  35. 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 arithmetics (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Counterfactual Knowledge, Factivity, and the Overgeneration of Knowledge.Jan Heylen - 2020 - Erkenntnis 87 (5):2243-2263.
    Antirealists who hold the knowability thesis, namely that all truths are knowable, have been put on the defensive by the Church-Fitch paradox of knowability. Rejecting the non-factivity of the concept of knowability used in that paradox, Edgington has adopted a factive notion of knowability, according to which only actual truths are knowable. She has used this new notion to reformulate the knowability thesis. The result has been argued to be immune against the Church-Fitch paradox, but it has encountered (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Computers, Persons, and the Chinese Room. Part 2: Testing Computational Cognitive Science.Ricardo Restrepo - 2012 - Journal of Mind and Behavior 33 (3):123-140.
    This paper is a follow-up of the first part of the persons reply to the Chinese Room Argument. The first part claims that the mental properties of the person appearing in that argument are what matter to whether computational cognitive science is true. This paper tries to discern what those mental properties are by applying a series of hypothetical psychological and strengthened Turing tests to the person, and argues that the results support the thesis that the Man performing the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. Unknowable Truths.Zachary Goodsell, John Hawthorne & Juhani Yli-Vakkuri - forthcoming - Journal of Philosophy.
    In an anonymous referee report written in 1945, Church suggested a sweeping argument against verificiationism, the thesis that every truth is knowable. The argument, which was published with due acknowledgement by Fitch almost two decades later, has generated significant attention as well as some interesting successor arguments. In this paper, we present the most important episodes in this intellectual history using the logic that Church himself favoured, and we give reasons for thinking that the arguments are less than (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Bringing about and conjunction: A reply to Bigelow on omnificence.Ghislain Guigon - 2009 - Analysis 69 (3):452-458.
    Church and Fitch have argued that from the verificationationist thesis “for every proposition, if this proposition is true, then it is possible to know it” we can derive that for every truth there is someone who knows that truth. Moreover, Humberstone has shown that from the latter proposition we can derive that someone knows every truth, hence that there is an omniscient being. In his article “Omnificence”, John Bigelow adapted these arguments in order to argue that from the assumption (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  40. How does Artificial Intelligence Pose an Existential Risk?Karina Vold & Daniel R. Harris - 2023 - In Carissa Véliz (ed.), The Oxford Handbook of Digital Ethics. Oxford University Press.
    Alan Turing, one of the fathers of computing, warned that Artificial Intelligence (AI) could one day pose an existential risk to humanity. Today, recent advancements in the field AI have been accompanied by a renewed set of existential warnings. But what exactly constitutes an existential risk? And how exactly does AI pose such a threat? In this chapter we aim to answer these questions. In particular, we will critically explore three commonly cited reasons for thinking that AI poses an (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  41. The Kochen - Specker theorem in quantum mechanics: a philosophical comment (part 1).Vasil Penchev - 2013 - Philosophical Alternatives 22 (1):67-77.
    Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  42. Apologetica Bisericii Primare.Apostolache Ionita - 2021 - Craiova, România: Mitropolia Olteniei.
    The confessional work of the Church has been from the very beginning a foundation and basis for the Divine Truth. Starting from this real necessity, the Apologetic Theology claims some important research directions, grounded on the Holy Scripture and the Holy Tradition. Given this historical and doctrinal context, we can highlight the next support coordinates of the Christian Apologetics background: “the truth of God’s existence, the reality of the supernatural world and man’s immortality. All of this are, as we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43.  25
    Rudbeckius, Hägglund’s Codex, and the Problem of Authorship Ascription.Tero Tulenheimo - 2024 - Svensk Teologisk Kvartalskrift 100:159–176.
    In 1992, Bengt Hägglund put forward a thesis according to which a codex in his possession is based on material Johannes Rudbeckius (1581–1646) authored in 1611, maintaining that the codex gives us information about Rudbeckius's lectures on _loci theologici_ in Uppsala during the years 1611–1613 and that it reveals to us characteristic features of Rudbeckius's thinking about dogmatics. Hägglund published the codex in 2001. I point out, first, weaknesses in Hägglund's argumentation. Second, I present indirect evidence against his thesis employing (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. The Bit (and Three Other Abstractions) Define the Borderline Between Hardware and Software.Russ Abbott - 2019 - Minds and Machines 29 (2):239-285.
    Modern computing is generally taken to consist primarily of symbol manipulation. But symbols are abstract, and computers are physical. How can a physical device manipulate abstract symbols? Neither Church nor Turing considered this question. My answer is that the bit, as a hardware-implemented abstract data type, serves as a bridge between materiality and abstraction. Computing also relies on three other primitive—but more straightforward—abstractions: Sequentiality, State, and Transition. These physically-implemented abstractions define the borderline between hardware and software and between (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Why computers can't feel pain.John Mark Bishop - 2009 - Minds and Machines 19 (4):507-516.
    The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  46. Cognitivism about Epistemic Modality and Hyperintensionality.David Elohim - manuscript
    This essay aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of Voevodsky's Univalence Axiom and function type equivalence in Homotopy Type Theory, in order to specify an abstraction principle for epistemic (hyper-)intensions. The homotopic abstraction principle for epistemic (hyper-)intensions provides an epistemic conduit for our knowledge of (hyper-)intensions as abstract objects. Higher observational type theory might be one way to make first-order abstraction principles defined via inference rules, although not higher-order (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47. Religion and Politics in Nicaragua: A Historical Ethnography Set in the City of Masaya.Catherine Stanford - 2008 - Dissertation, State University of New York (Suny)
    UMI Number: 3319553 This study is a historical ethnography of religious diversity in post-revolutionary Nicaragua from the vantage point of Catholics who live in the city of Masaya located on the Pacific side of Nicaragua at the end of the twentieth century. My overarching research question is: How may ethnographically observed patterns in Catholic religious practices in contemporary Nicaragua be understood in historical context? Utilizing anthropological theory and method grounded in Weberian historical theory, I explore Catholic ritual as contested politico-religious (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  48. There is no general AI.Jobst Landgrebe & Barry Smith - 2020 - arXiv.
    The goal of creating Artificial General Intelligence (AGI) – or in other words of creating Turing machines (modern computers) that can behave in a way that mimics human intelligence – has occupied AI researchers ever since the idea of AI was first proposed. One common theme in these discussions is the thesis that the ability of a machine to conduct convincing dialogues with human beings can serve as at least a sufficient criterion of AGI. We argue that this very (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Worlds 3 Popper 0. [REVIEW]Ray Scott Percival - 1995 - New Scientist (19th May).
    THE MIND-BODY PROBLEM: A GUIDE TO THE CURRENT DEBATE (EDITED BY RICHARD WARNER AND TA D E U S Z SZUBKA) contains recent essays by the key players in the the field of the Mind-Body problem: Searle, Fodor, Problem Honderich, Nagel, McGinn, Stich, Rorty and others. But there are a few interesting exceptions, for example Edelman, Popper, Putnam and Dennett. Nevertheless, these thinkers do get a mention here and there, and nearly all the exciting topical issues are dealt with, including (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. Cognition and Recognition.Nathan Salmon - 2018 - Intercultural Pragmatics 15 (2):213-235.
    Expressions are synonymous if they have the same semantic content. Complex expressions are synonymously isomorphic in Alonzo Church’s sense if one is obtainable from the other by a sequence of alphabetic changes of bound variables or replacements of component expressions by syntactically simple synonyms. Synonymous isomorphism provides a very strict criterion for synonymy of sentences. Several eminent philosophers of language hold that synonymous isomorphism is not strict enough. These philosophers hold that ‘Greeks prefer Greeks’ and ‘Greeks prefer Hellenes’ express (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 962