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 of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

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 against the possibility of building a machine that passes the Turing test. Finally, I respond to objections against the proposed link between questions in the philosophy of mind and philosophy of computer science. (shrink)

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. Third, to emphasize ontological differences between different time complexities, which seem to provide a solid base for a better understanding of artificial intelligence in general. (shrink)

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 Church–Turing 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 of an effective procedure--without reliance on any (partially) mathematical thesis or conjecture concerning effective procedures, such as the Church–Turing thesis--that the class of effective procedures is undecidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. The proof does not appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of such a procedure. Though this undecidability result itself is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure is, in fact, a decision procedure, i.e., effective—for example, that it invariably terminates with the correct verdict. (shrink)

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 (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

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 that they do not have output states, or they are specified such that they do have output states, but involve contradiction. Repairs though non-effective methods or special rules for semi-decidable problems are sought, but not found. The paper concludes that hypercomputing supertasks are impossible in the actual world and thus no reason for rejection of the Church-Turing thesis in its traditional interpretation. (shrink)

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 Church–Turing 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 effective. This undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

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 an incomputable information source in accordance with Bell’s constraints. On condition that we give up the formal concept of “universality”, the possibility to realize quantum oracles is reachable. In this way computation is led back to the logic of physical world. (shrink)

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. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

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 (...) and relation between epistemic mathematical modality and metaphysical mathematical modality. The discrepancy between the modal systems governing the parameters in the two-dimensional intensional setting provides an explanation of the difference between the metaphysical possibility of absolute decidability and our knowledge thereof. I also advance a topic-sensitive epistemic two-dimensional truthmaker semantics, if hyperintensional approaches are to be preferred to possible worlds semantics. I examine the relation between two-dimensional hyperintensional states and epistemic set theory, providing two-dimensional hyperintensional formalizations of the modal logic of ZFC, large cardinal axioms, $\Omega$-logic, and the Epistemic Church-Turing Thesis. (shrink)

Abstract The Theory of Computation in its existed form is based on Church –Turing 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.

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.

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 (...) argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models. (shrink)

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? (...) - 4 Doukas Kapantais: - A refutation of the Church-Turing thesis according to some interpretation of what the thesis says - 5 Paul Schweizer: - In What Sense Does the Brain Compute? - 2) Philosophy of computer science & discovery - 6 Mark Addis, Peter Sozou, Peter C R Lane and Fernand Gobet: - Computational Scientific Discovery and Cognitive Science Theories - 7 Nicola Angius and Petros Stefaneas: - Discovering Empirical Theories of Modular Software Systems. An Algebraic Approach. - 8 Selmer Bringsjord, John Licato, Daniel Arista, Naveen Sundar Govindarajulu and Paul Bello: - Introducing the Doxastically Centered Approach to Formalizing Relevance Bonds in Conditionals - 9 Orly Stettiner: - From Silico to Vitro: - Computational Models of Complex Biological Systems Reveal Real-world Emergent Phenomena - 3) Philosophy of cognition & intelligence - 10 Douglas Campbell: - Why We Shouldn’t Reason Classically, and the Implications for Artificial Intelligence - 11 Stefano Franchi: - Cognition as Higher Order Regulation - 12 Marcello Guarini: - Eliminativisms, Languages of Thought, & the Philosophy of Computational Cognitive Modeling - 13 Marcin Miłkowski: - A Mechanistic Account of Computational Explanation in Cognitive Science and Computational Neuroscience - 14 Alex Tillas: - Internal supervision & clustering: - A new lesson from ‘old’ findings? - 4) Computing & society - 15 Vasileios Galanos: - Floridi/Flusser: - Parallel Lives in Hyper/Posthistory - 16 Paul Bello: - Machine Ethics and Modal Psychology - 17 Marty J. Wolf and Nir Fresco: - My Liver Is Broken, Can You Print Me a New One? - 18 Marty J. Wolf, Frances Grodzinsky and Keith W. Miller: - Robots, Ethics and Software – FOSS vs. Proprietary Licenses. (shrink)

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 other scientific theories, in particular the first theories of both mechanical machines and heat machines. A more accurate examination of Theory of Computation shows a difference from the above mentioned theories in its essentially including an odd notion, “thesis”, to which no theorem corresponds. On the other hand, arguments of each of the other theories conclude a doubly negative predicate which then, by applying the inverse translation of the ‘negative one’, is translated into the corresponding affirmative predicate. By also taking into account three criticisms to the current Theory of Computation a rational re-formulation of it is sketched out; to Turing-Church thesis of the usual theory corresponds a similar proposition, yet connecting physical total computation functions with constructive mathematical total computation functions. -/- . (shrink)

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 (...) powerfully rooted in economic imperatives, belief that only those Justified True Beliefs can be treated as ‘knowledge’ which are, further, categorically communicable as Factually Grounded Beliefs—hence as comprehensible pre-formal ‘mathematical truths’—by any intelligence that lays claims to a mathematical lingua franca. We argue that this seeming irreconcilability merely reflects a widening chasm between an increasing under-estimation of the value to society of ‘semantic arithmetical truth’, and an increasing over-estimation of the value to society of ‘syntactic set-theoretical provability’; a chasm which must be narrowed and bridged explicitly. We thus proffer a Complementarity Thesis which seeks to recognize that mathematical ‘provability’ and mathematical ‘truth’ need to be interdependent and complementary, ‘evidence-based’, assignments-by-convention to the formulas of a formal mathematical language; where (a) the goal of mathematical ‘proofs’ may be viewed as seeking to ensure that any mathematical language intended to formally represent our pre-formal conceptual metaphors and their inter-relatedness is unambiguous, and free from contradiction; whilst (b) the goal of mathematical ‘truths’ must be viewed as seeking to ensure that any such representation does, indeed, uniquely identify and adequately represent such metaphors and their inter-relatedness. Our thesis is that, by universally ignoring the need to introduce goal (b) in our curriculum, the teaching of, and research in, mathematics at the post-graduate level cannnot justify its value to society beyond the mere intellectual stimulation of individual minds. In the second part we appeal to some recent—and hitherto unsuspected—unarguably constructive Tarskian interpretations, of the first-order Peano Arithmetic PA, which establish PA as both finitarily consistent, and categorical. Since we also show that the second order subsystem ACA0 of Peano Arithmetic and PA cannot both be assumed provably consistent, we conclude that there can be no mathematical, or meta-mathematical, proof of consistency for Set Theory. Hence the theorems of any Set Theory are not sufficient for distinguishing between (i) what we can believe to be a ‘mathematical truth’; (ii) what we can evidence as a ‘mathematical truth’; and (iii) what we ought not to believe is a ‘mathematical truth’; whilst the theorems of the first-order Peano Arithmetic PA are sufficient for distinguishing between (i), (ii) and (iii). We conclude from this that the holy grail of mathematics ought to be ‘arithmetical truth’, not ‘set-theoretical proof’. (shrink)

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 (...) loss of information, the concept of arithmetic logical entropy can be used. The Turing machine and its equivalent, general recursive functions can be understood through the λ calculus and the Turing/Church thesis. However, there are certain recursive functions that cannot be fully understood or predicted by other algorithms due to the loss of information during logical-arithmetic operations. In other words, the behaviour of these functions cannot be completely determined at every stage of the computation due to a lack of information in their definition. While there are some cases where the behaviour of recursive functions is highly predictable, the lack of information in most cases makes it impossible for algorithms to determine if a program will halt or not. This inability to predict the outcome of the computation is the essence of the halting problem of the Turing machine. Even in cases where more information is available about the program, it is still difficult to determine with certainty if the program will halt or not. This also highlights the importance of the Turing oracle machine, which introduces information from outside the computation to compensate for the lack of information and ultimately decide the result of the computation. (shrink)

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 .

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 credence to atheism by explaining away religious belief or whether it actually strengthens some already powerful arguments against atheism in the relevant philosophical literature.We argue that the recent discoveries of CSR hurt, not help, the atheist position—that CSR, if anything, should not give atheists epistemic assurance. (shrink)

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 situation, defending the Turing Test requires establishing a relationship between thought and language. In this regard, Davidson's no-priority theory is presented as an approach for defending the test. (shrink)

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 (...) in our finitary tool, which is our complete language. (shrink)

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 different mathematical languages (the instruments of investigation). Together with traditional mathematical languages using such concepts as ‘enumerable sets’ and ‘continuum’ a new computational methodology allowing one to measure the number of elements of different infinite sets is used in this paper. It is shown how mathematical languages used to describe the machines limit our possibilities to observe them. In particular, notions of observable deterministic and non-deterministic Turing machines are introduced and conditions ensuring that the latter can be simulated by the former are established. (shrink)

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.

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 (...) mentales se realicen en las propiedades físicas de engranajes y máquinas reales. This article deals with how Turing Machine Functionalism turns out to be compatible with a form of Dualism, which involves that strong AI is not close to the original Materialism that inspired it in the nineteenth century. To support this thesis, I argue that there is a compelling coincidence between Descartes' philosophy and this version of Functionalism, since the former holds that it is conceivable/possible to separate mind and body, while the latter holds that it is not strictly necessary that mental states are realized by the physical properties of real cogs and machines. (shrink)

This is PhD thesis submitted to Institute Philosophy of Russian Academy of Science in March 2021.

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. While Kearns (2021) set out to avoid the confusion of a de re claim with a de dicto claim, which Prior (1955) accused Berkeley of, Kearns can be accused of making a similar conceptual confusion. (shrink)

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 (...) terms such as disruption, dissociation, disfunction, disjunctions and dispersion not only referred to architectural problems but also applied to political criticism and the deepest foundations of thinking itself. His collaboration with Derrida manifested itself primarily in the publication La Case Vide: La Villette, 1985, in which the architect’s design drawings and texts explaining his concepts related to the Park de La Villette were accompanied by an extensive essay by Derrida, which included theoretical problems taken up by Tschumi in a philosophical context. Architectural and philosophical issues were also combined during seven discussion meetings organised by Peter Eisenman, invited by Tschumi to collaborate on the design of the Parc de La Villette. Eisenman, who, like Tschumi, invited Derrida to participate in the design of the park and also led to the publication of Chora L Works: Jacques Derrida and Peter Eisenman, in which his ideas were confronted with Derrida’s philosophical text. In this case, Derrida’s essay was not a direct commentary on the architect’s concepts, but rather a reflection on the question of the chôra presented by Plato in Timaeus. During the discussion and in his essay, Derrida pointed out that the chôra is a component of the created world, yet it does not belong to it, but precedes it. The originality of the chôra is so radical that she also precedes all the factors of creating the world, including ideas and the Demiurge. Thus a thesis appeared in the metaphysics of the West that the chôra is a form of active abyss, in relation to which all beings are secondary, both those perfect (as ideas or God) and those created, such as the world, things, people or language. This leads to the conclusion that the chôra does not exist, because all existence is a derivative of the chôra. Nor could the chôra be described, since it is a form of developing a space that is preceded by a lack of space characteristic of the chôra. Derrida intended the chôra to be an instance with an exceptional degree of transcendentalism, an anti-metaphysical instance, but also an a-theological one. However, this attempt failed, both in the field of secular philosophy and in the field of theology. Derrida’s characteristics of the chôra to strengthen its transcendentalism and negation of metaphysics had to be expressed in a language that immediately produces new concepts and a new metaphysics that reproduces the categories of the beginning, the origin or the foundation known from earlier philosophical traditions. All forms of criticism of metaphysics are also inspired by negative, apophatic and mystical theology. The undermining of many concepts of permanent meaning and the introduction of new concepts of unstable meaning, characteristic of the philosophy of deconstruction, had many features of originality, but it was directed towards problems whose solutions repeat, with the use of new vocabulary, the findings known in culture since Democritus. Thus, if apophatic philosophy can be regarded as deconstruction avant la lettre, then deconstruction itself in its late versions began to take on the features of a new religion. The exchange of inspiration between theology and deconstruction was manifested in a series of scientific conferences and publications in which Derrida’s philosophical concepts were interpreted within the scope of religious thought. Theological threads began to be found in such concepts of deconstruction as différance or the chôra, while at the same time Derrida himself undertook in his philosophy to study problems such as the Other (L’Autre) or Impossible (Impossible), which belonged to newer theological traditions. As a consequence of the new problems, the deconstruction became closer to the features of a new religion. Philosophy, at least from Kant’s time, has tried to create a system that would take over from religion the tasks of setting moral and political goals. Similarly, Derrida has directed his interest towards the problems of democracy and ethics, which would enable their renewal. Attempts to create a new religion (cleared of old metaphors), a new community or a new democracy bring problems and threats which may be no less troublesome than the previous systems. All promises of freedom carry with them threats, the greater the more they strive for perfection. The renewal of existential orders, sometimes carried out by means of violent changes, is a certain repetitive feature of human cultures. Deep changes, however, do not protect against the return of both old gods and old demons. Tschumi and Derrida were shaped in their youth by the atmosphere of leftist rebellion against the moral and political limitations of ossified communities and the imperfections of democracy. The ethical theme distinguishes many of their works, including the Parc de La Villette. The opposition to the metaphysical traditions of philosophy and architecture contained in this park was prompted by specific political situations and resulted from bringing political issues to the level of philosophical considerations. Achievements made at the level of pure concepts were then subject to elevation, to a kind of sacralization, which made them religious concepts. The deconstruction reached for the stratus of the new religion especially when it found its followers and began to generate moral obligations. In the new situation, terms such as the chôra, l’autre or the Impossible were absolutized and in relation to them a cult and attitude of adoration emerged. The Parc de La Villtette then gained new post-secular meanings, which allow it to be assigned the function of a Temple of Otherness (L’Autre) and Impossible. (shrink)

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 (...) is shown that digital metaphysics contradicts itself by leading to the conclusion that the shortest computer program that computes the world is infinitely long. This means that the Church-Turing conjecture must be false. Secondly, the applicability of Occam’s razor is explained by evolution: in an evolving physics it can appear at each moment as if the world is caused by only finitely many things. Thirdly and most importantly, this metaphysics is benevolent in the sense that it organizes itself to fulfill the deepest wishes of its observers. Fourthly, universal computers with an infinite memory capacity cannot be built in the world. And finally, all the properties of the world, both good and bad, can be explained by evolutionary conservation. (shrink)

If the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible machines whose powers exceed the Church–Turing limit (e.g. accelerating Turing machines). Some of these supermachines realize superminds. Superminds perform cognitive supertasks. Their thoughts are formed in infinitary languages. They perceive and manipulate the infinite detail (...) of fractal objects. They have infinitely complex bodies. Transfinite games anchor their social relations. (shrink)

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 this article we will look closer at two proposals along these lines :557–568, 1985; Fuhrmann in Synthese 191:1627–1648, 2014a), because there are formal models available for each. It will be argued that, even though the problem of omniscience can be averted, the problem of possible or potential omniscience cannot: there is an accessible state at which all truths are known. Furthermore, it will be argued that possible or potential omniscience is a price that is too high to pay. Others who have proposed to solve the paradox with the help of a factive concept of knowability should take note :53–73, 2010; Spencer in Mind 126:466–497, 2017). (shrink)

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 (...) include sub-symbolic information processing. We investigate whether pancomputationalism can provide the basic causal structure to the world and whether the overall research program of info-computationalist naturalism appears productive, especially when it comes to new approaches to the living world, including computationalism in the philosophy of mind. (shrink)

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 (...) discussed in Section I. Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

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 decisive. However, we present some new arguments against verificationism that we believe to be dialectically effective. (shrink)

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 computations characteristic of understanding Chinese actually understands Chinese. The supposition that the Man does not understand Chinese has gone virtually unquestioned in this foundational debate. The persons reply acknowledges the intuitive power behind that supposition, but knows that brute intuitions are not epistemically sacrosanct. Like many intuitions humans have had, and later deposed, this intuition does not withstand experimental scrutiny. The second part of the persons reply consequently holds that computational cognitive science is confirmed by the Chinese Room thought experiment. (shrink)

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 "every contingent proposition is such that if it is true something brought it about that it is true" we can derive that there is an omnificent being: a being that brings it about that every true contingent proposition is true. In my reply to his article, I show that Bigelow’s argument is flawed because there is some formal property that the knowledge operator has but that the bringing about operator lacks. This is the property of distributing over conjunctions. I explain why what brings it about that some conjunctive proposition is true need not bring it about that its conjuncts are true. (shrink)

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 several other triviality objections. Schlöder in a forthcoming paper defends the general approach taken by Edgington, but amends it to save it in turn from the triviality objections. In this paper I will argue, first, that Schlöder's justification for the factivity of his version of the concept of knowability is vulnerable to criticism, but I will also offer an improved justification that is in the same spirit as his. To the extent that some philosophers are right about our intuitive concept of knowability being a factive one, it is important to explore factive concepts of knowability that are made formally precise. I will subsequently argue that Schlöder's version of the knowability thesis overgenerates knowledge or, in other words, it leads to attributions of knowledge where there is ignorance. This fits a general pattern for the research programme initiated by Edgington. This paper also contains preliminary investigations into the internal and logical structure of lines of inquiries, which raise interesting research questions. (shrink)

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 (...) existential threat to humanity: the control problem, the possibility of global disruption from an AI race dynamic, and the weaponization of AI. (shrink)

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 (...) can say, the Christian specific starting from the first ages. The truths about the divine origin of Christianism are to be found here, on the dignity of this revealed doctrine, on the divine-human character of his Founder, on the importance and necessity of Christian Church for the religious and morale life of human kind”. . Apologetics and (or) Fundamental Theology The reason why the Church must justify her teaching in the context of her missionary activity does not rise up from inner necessity. It does more from external misconceptions. In this context we can define the main concern of apologetics as a theological discipline. On the other hand, one can discover almost the same meaning in Fundamental Theology. However, as a difference between them, Fundamental Theology is interested in the direction and bears informative message, since “it aims at basic religious principles systematic presentation, both external and internal, as well as their justification before the scientific-theological conscience of believers. Thereafter, Christianity can be considered the only true religion”. On the other hand, one can claim that the name of “Apologetics” rises up from the necessity that the Christian arguments must be scientifically enforced and illustrated externally. Therefore, the mission of Christian Apologetics is to reject the anti-Christian objections through the power of the theological arguments in dialogue with philosophy, culture or science. In fact, even the object of Apologetics is "the scientific ground of Christian truths" with the purpose to "offer the Truth, reject error, and eradicate lies." In order to achieve its goal, Christian Apologetics offers us a positive method, which consists in "a logical and direct development of a certain thesis, in clarifying a certain truth, by revealing its content and the outcomes deriving from it". Therefore, we have a very dynamic field through which this discipline comes and supports the active life of the Church. Moreover, the method of the Apologetics as a theological subject is based on a conceptual struggle, very active starting with the very first centuries of the Early Church. Due to its energetic character, Fundamental Theology won its most important place among Christian doctrines. “Through struggle, Fundamental Theology imposed itself as a theological subject and became individualised. Through struggle and only through struggle, Fundamental Theology must exist and strengthen the positions of Christianity”. In its theologically mission, Christian Apologetics identifies and also prevents the alteration of the doctrinal truth. In this concern, it has the responsibility to enforce of believers’ moral conscience in their spiritual process of development. As a subject, one can say that the mission of Apologetics is “rational, objective and represents a very important basis for the Christian truths of faith”. Therefore, one can notice that the most important aspect of our subject is to enforce the Christian faith and experience through proper knowledge of the fundamental principles of the doctrine. This is the reason why we also mention Apologetics together with Fundamental Theology. However, we must highlight a few important details regarding the sensible difference between both of the denominations. Therefore, historically speaking, “they both arise from those who personally share Christian faith and act within the believing community and in its service. They both aim to respond to objections raised by critics and to offer a trustworthy account of main beliefs about matters as the existence of a personal God, the divine self-revelation in Jesus Christ, and the nature of faith”. On the other hand, we can identify almost three important differences between Apologetics and Fundamental Theology. “First, a Christian apologist can simply address a question: does the existence of horrendous evil in our world rule out the existence of almighty and all-loving God? or has science caused faith in God to be demoted in the past? … Second, good Apologetics has typically a sharply defined audience: Apologetics can seek, for example, to alert non-believers to the weakness of the case currently being against God and religion. But Fundamental Theology addresses to a wider range of readers … Third, polemics (in the good sense of this word and not as mindless ranting) belong to the exercise of Apologetics … The tone of fundamental theologians, even when rebutting objections to Christian faith, is or should be more expository and less polemically inclined to illustrate defects in opposing positions”. Moreover, we must mention that Apologetics can be considered as a particular subject. Although, it is similar in terms of content with Dogmatic and Philosophy through its method, our subject has its own research direction. Therefore, if Dogmatic is defined by an expositive and imperative character, Apologetics is demonstrative and constraining. In other words, dogmatic rationality, which has a subsidiary role, in Apologetics becomes primordial. In this case, “the faith truths become truths also for the rationality and moreover, the eternal truths of the Divine Reason become constraining for the human reason, too. Truths of natural religion, which are in fact the object of the Philosophy of Religion, are conditioned in Apologetics by the Absolute Truth completed in the Christian faith”. In all its theological and external interaction perspectives, Apologetics holds the main role to “expose, defend and justify with rational meanings the general truths of religion”. It is necessary to clear up one aspect: as subject, Apologetics is different from Apology. On the one hand, one can speak about the general research background and, on the other hand, one can describe a singular part of theological approach. Therefore, these two “theological sisters” are different depending on the type of approach. However, Apology is older than Apologetics. Among the first Christian apologists, we mention: Saint Justin the Martyr and Philosopher, Tatian, Athenagoras or Tertullien. In its current meaning, Apologetics is of a western theological origin, having its beginning in Middle Ages. Even so, its blooming age is the 18th century, when the Western Catholic Church replied to the materialist and atheistic philosophy. In the Eastern Church this type of confession had a more profound theological overview, in a theonomic perspective. “In the light of the Holy Scripture, the eastern theological thinking always shows priority to the divine Revelation in spite of the philosophical human systems and places the Creator - Logos at the basis of all creation, in the light of biblical thoughts”. -/- II. “Rational-spiritual Apologetics” Reverend Professor Dumitru Popescu, one of the most important Romanian theologians, develops the concept of “Rational-spiritual Apologetics”. In his theological approach, he illustrates the fact that one of the most essential part of the Church’s confessional work are the relations between rational arguments and spiritual purpose of the Christian life. In this case, we can identify two possibilities of argumentation: rational and spiritual, each of them in connection with the knowledge of God. This is in fact, the Orthodox specificity of the Apologetics, as theological subject, in contrast with the principles of western scholastic. Therefore, the most important argument, which Dumitru Popescu brings up in the support of his thesis, belongs to Saint Maximus the Confessor’s theology: “The Scripture provide a double knowledge of the divine things. One is relative and consists in its rationality and meanings, without the direct feeling of God. Through it we are guided in this life. The other one is in a true sense true and consists in leaving experience of divine grace, outside rationality and meanings, having the complete experience of God. Through it we will receive in the future life the deification”. On the other hand, we can understand that the purpose of human rationality is not to replace the spiritual perspective, since human mind does not own the divine mystery. In this case, rationality can be useful in discovering and demonstrating the existence of God from natural realities to a point where we must assume a spiritual understanding. Consequently, in the context of human deification, the orthodox theology cannot conceive the gnoseological process in rational terms. Therefore, Rev. Dumitru Popescu carries out a dual argumentation: 1. since God is not a solitary power, but descends and interacts with man providentially (through His divine grace and energies); 2. because the created world doesn’t have an independent rationality through which man can receive the possibility to reach God. Therefore, Father Professor Dumitru Popescu concludes that “the deification process is here, on the earth, a foretaste of immortality, which springs from the personal meeting of man with God”. One of the most recent Romanian Apologetics academically approach is the book of professor Adrian Lemeni: “Truth and Demonstration”. Except his very complex analysis on the interaction between theology and science, Professor Lemeni goes further and perfects Dumitru Popescu’s theological view, on the “Rational-spiritual” character of Orthodox Apologetics. Therefore, he offers a very important example, starting from Saint Gregory Palamas’ theological view. In his work “the authority of Patristic gnoseology” is illustrated, which is offered by the “Eternal Truth, God’s Word, incarnated in the Person of Jesus Christ”. “The authority of patristic gnoseology” – notes down Adrian Lemeni – “is expressed along the process for searching the truth of knowledge illustrated by deeds and life. In his debate with Varlaam from Calabria, Saint Gregory Palamas insists on the power of persuasion which arises from the Church’s Tradition, biblical and patristic fundamentally. In an ultra-confident argument, based on the autonomic logical power, we believe that one word has power over another. But Saint Gregory Palamas shows that the truth is based and validated through spiritual and ecclesiastical experience. Truth is validated by the words and deeds of the Holy Fathers, in direct connection with apostolic Tradition. Any argument can be fought against by another argument. Nevertheless, the apologetic concession based on the deeds of the saints is unbookable. This is the thesis which Saint Gregory Palamas develops in complete harmony with the patristic gnoseological Tradition”. Therefore, we can consider that the position of the subject of Apologetics (of Fundamental Theology) is one of interactions. It has connections with all domains external to Theology. In this case, we can consider it sets up a dialogue or debate with philosophy, culture or science. Starting from the historical argument, this interaction between theology and other sciences has existed from the very first Christian century. Therefore, we have an apologetic literary genre starting with the first patristic writings. Including the Early Church, we can identify three important stages in terms of historical apologetics development: 1. The Christian apologists struggle age with Judaism and paganism; 2. From the issue of Islam to the Middle Eve; 3. From the period of the Renaissance of Western sciences to the present day. (shrink)

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 abstraction principles, computable. The truth of my first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable i.e. Turing computable and the Turing machine being physically implementable. Epistemic modality and hyperintensionality can thus be shown to be both a compelling and a materially adequate candidate for the fundamental structure of mental representational states, comprising a fragment of the language of thought. (shrink)

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 (...) important implications for turing machine functionalism and the prospect of ‘conscious’ machines. In the paper, instead of seeking to develop Putnam’s claim that, “everything implements every finite state automata”, I will try to establish the weaker result that, “everything implements the specific machine Q on a particular input set ( x )”. Then, equating Q ( x ) to any putative AI program, I will show that conceding the ‘strong AI’ thesis for Q (crediting it with mental states and consciousness) opens the door to a vicious form of panpsychism whereby all open systems, (e.g. grass, rocks etc.), must instantiate conscious experience and hence that disembodied minds lurk everywhere. (shrink)

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 (...) physicality and abstraction. At a deeper level, asking how a physical device can interact with abstract symbols is the wrong question. The relationship between symbols and physical devices begins with the realization that human beings already know what it means to manipulate symbols. We build and program computers to do what we understand to be symbol manipulation. To understand what that means, consider a light switch. A light switch doesn’t turn a light on or off. Those are abstractions. Light switches don’t operate with abstractions. We build light switches, so that when flipped, the world is changed in such a way that we understand the light to be on or off. Similarly, we build computers to perform operations that we understand as manipulating symbols. (shrink)

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 (...) class='Hi'>thesis employing the two series of Rudbeckius's published dissertations on dogmatics (1611–1613, 1620–1644) and his own comments about his lectures. Third, I indicate that three parts of the codex that are particularly important for Hägglund's argumentation stem from other authors: the introductory part on the nature of theo­logy, as well as the chapter on _locus de ecclesia_, have their origin in Jesper Brochmand's _Universae theologiae systema_ (1633), while the conclusion is taken from a dissertation that Balthasar Meisner published in 1614. The codex does not allow us to access a work Rudbeckius would have authored in 1611: it contains too many parts he cannot have authored then. In particular, the introduction and the conclusion of the codex do not tell us anything about Rudbeckius's characteristic thoughts on dogmatics. Hägglund's main reason for thinking that the codex is a transcript of Rudbeckius's work from 1611 is a date mentioned at the end of locus of the church. As it happens, this locus is borrowed from Brochmand, not from Rudbeckius. (shrink)

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 (...) – Is continuality universal? – Diffeomorphism and velocity – Einstein’s general principle of relativity – „Mach’s principle“ – The Skolemian relativity of the discrete and the continuous – The counterexample in § 6 of their paper – About the classical tautology which is untrue being replaced by the statements about commeasurable quantum-mechanical quantities – Logical hidden parameters – The undecidability of the hypothesis about hidden parameters – Wigner’s work and и Weyl’s previous one – Lie groups, representations, and psi-function – From a qualitative to a quantitative expression of relativity − psi-function, or the discrete by the random – Bartlett’s approach − psi-function as the characteristic function of random quantity – Discrete and/ or continual description – Quantity and its “digitalized projection“ – The idea of „velocity−probability“ – The notion of probability and the light speed postulate – Generalized probability and its physical interpretation – A quantum description of macro-world – The period of the as-sociated de Broglie wave and the length of now – Causality equivalently replaced by chance – The philosophy of quantum information and religion – Einstein’s thesis about “the consubstantiality of inertia ant weight“ – Again about the interpretation of complex velocity – The speed of time – Newton’s law of inertia and Lagrange’s formulation of mechanics – Force and effect – The theory of tachyons and general relativity – Riesz’s representation theorem – The notion of covariant world line – Encoding a world line by psi-function – Spacetime and qubit − psi-function by qubits – About the physical interpretation of both the complex axes of a qubit – The interpretation of the self-adjoint operators components – The world line of an arbitrary quantity – The invariance of the physical laws towards quantum object and apparatus – Hilbert space and that of Minkowski – The relationship between the coefficients of -function and the qubits – World line = psi-function + self-adjoint operator – Reality and description – Does a „curved“ Hilbert space exist? – The axiom of choice, or when is possible a flattening of Hilbert space? – But why not to flatten also pseudo-Riemannian space? – The commutator of conjugate quantities – Relative mass – The strokes of self-movement and its philosophical interpretation – The self-perfection of the universe – The generalization of quantity in quantum physics – An analogy of the Feynman formalism – Feynman and many-world interpretation – The psi-function of various objects – Countable and uncountable basis – Generalized continuum and arithmetization – Field and entanglement – Function as coding – The idea of „curved“ Descartes product – The environment of a function – Another view to the notion of velocity-probability – Reality and description – Hilbert space as a model both of object and description – The notion of holistic logic – Physical quantity as the information about it – Cross-temporal correlations – The forecasting of future – Description in separable and inseparable Hilbert space – „Forces“ or „miracles“ – Velocity or time – The notion of non-finite set – Dasein or Dazeit – The trajectory of the whole – Ontological and onto-theological difference – An analogy of the Feynman and many-world interpretation − psi-function as physical quantity – Things in the world and instances in time – The generation of the physi-cal by mathematical – The generalized notion of observer – Subjective or objective probability – Energy as the change of probability per the unite of time – The generalized principle of least action from a new view-point – The exception of two dimensions and Fermat’s last theorem. (shrink)

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 (...) different propositions even if they are synonymously isomorphic. They hold that the very recurrence (multiple occurrence) of ‘Greeks’ contributes to the proposition expressed something that indicates the very recurrence in question. Kit Fine argues that this thesis, which he labels semantic relationism calls for a radically new conception of semantics. I have argued that the relevant phenomenon is wholly pragmatic, entirely non-semantic. Here I supplement the case with a new argument. No cognition without recognition—or almost none. With this observation, standard Millianism has sufficient resources to confront Frege’s puzzle and related problems without injecting pragmatic phenomena where they do not belong. (shrink)

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 ability should be accepted also as a necessary condition of AGI, and we provide a description of the nature of human dialogue in particular and of human language in general against this background. We then argue that it is for mathematical reasons impossible to program a machine in such a way that it could master human dialogue behaviour in its full generality. This is (1) because there are no traditional explicitly designed mathematical models that could be used as a starting point for creating such programs; and (2) because even the sorts of automated models generated by using machine learning, which have been used successfully in areas such as machine translation, cannot be extended to cope with human dialogue. If this is so, then we can conclude that a Turing machine also cannot possess AGI, because it fails to fulfil a necessary condition thereof. At the same time, however, we acknowledge the potential of Turing machines to master dialogue behaviour in highly restricted contexts, where what is called “narrow” AI can still be of considerable utility. (shrink)

The scientific study of consciousness, also referred to as consciousness science, is a young scientific field devoted to understanding how conscious experiences and the brain relate. It comprises a host of theories, experiments, and analyses that aim to investigate the problem of consciousness empirically, theoretically, and conceptually. This thesis addresses some of the questions that arise in these investigations from a formal and mathematical perspective. These questions concern theories of consciousness, experimental paradigms, methodology, and artificial consciousness. -/- Regarding theories (...) of consciousness, the thesis contributes to the understanding of the mathematical structure that some of the formal theories in the field propose. The work presented here targets the theory of consciousness known as Integrated Information Theory (IIT) and the neuroscientific theory known as Predictive Processing Theory or Free Energy Principle in its Active Inference form (AI-PP). The thesis provides axiomatic definitions of the mathematical structures that constitute these theories, and uses these definitions to address some of the open questions surrounding the theories. For AI-PP, this includes a rigorous derivation of the formula for Active Inference via Free Energy minimisation and a proof of compositionality of Free Energy. For IIT, this includes resolutions of some of the criticisms of IIT's formal scope and applications, but also the identification of new issues that concern the formalism and its derivation. When possible, the definitions are provided in the mathematical framework of category theory. -/- Regarding experiments, the thesis addresses the main paradigm for testing and falsifying theories of consciousness currently applied in the field. This paradigm consists of comparing the conscious experience that a theory predicts with the conscious experience that is inferred from behavioural data or report by use of measures of consciousness. The thesis provides a formal model of this paradigm and shows that under a certain condition—if inference and prediction are independent—, any minimally informative theory of consciousness can always be falsified. This is deeply problematic since the field’s reliance on report or behaviour to infer conscious experiences, in conjunction with the general structure of most contemporary theories of consciousness, implies such independence. This observation provides the exact formal underpinning of the well-known unfolding argument. The thesis analyses the origin of the problem and identifies precisely which changes are required to avoid this problem in future research. The thesis furthermore shows that the problem of falsifying theories of consciousness, and of empirical comparisons of theories of consciousness more generally, follows from a pervasive closure paradigm in consciousness science, that consists of taking a neuroscientific account of the brain as input to a theory of consciousness, so as to explain what consciousness is, without allowing for modifications or adaptations of the neuroscientific account that would accommodate consciousness as part of the brain's functioning. As is shown in the thesis, this paradigm has implications that point to a fundamental need of revision. -/- Regarding methodological and conceptual questions, the thesis contributes to the foundations of structural research in consciousness science. Structural research aims to use mathematical structures or mathematical spaces, instead of verbal descriptions or simple categorisations, to represent conscious experiences scientifically, for example when building theories of consciousness, or when exploring new empirical avenues to measure consciousness. Despite considerable advances in this realm, there was, prior to this thesis, no explicit definition of what a mathematical structure of conscious experience should be; that is, how the attribution of mathematical structure to conscious experiences should be systematically understood. Perhaps the most important contribution of this thesis to the field is to propose such a definition. The definition, a structural concept, extends existing approaches wherever available, and provides a basis for developing a common formal language to study consciousness, bridging developments as far apart as psychophysics and phenomenology. In addition, and independently of this proposal, the thesis offers a critical analysis of which metaphysical premises need to be presumed in structural research, whether the use of particular formal tools (such as structure-preserving mappings or homomorphisms) is justified, and how structural theories of consciousness could otherwise be built in the first place. An attempt to expand the results from consciousness to more general problems in philosophy of science is made in the context of the well-known Newman problem. -/- Regarding the question of artificial consciousness—can AI feel?—, the thesis contributes two results that take the form of no-go theorems, as known from physics. The first no-go theorem shows that if consciousness is relevant for the temporal evolution of a system's states—if it is dynamically relevant—, then contemporary AI systems cannot be conscious. That is because AI systems run on CPUs, GPUs, TPUs or other processors which have been designed and verified to adhere to computational dynamics that systematically preclude or suppress deviations. The second no-go theorem is situated in the context of computational functionalism, a view which posits that consciousness is a computation. The theorem shows that if computational functionalism holds true, consciousness cannot be a Turing computation. Rather, it must be a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation. -/- This thesis is part of a global effort to pioneer a mathematical perspective in consciousness science, now called Mathematical Consciousness Science. The hope behind the research carried out in this PhD is to illustrate the power and usefulness of mathematical approaches in different areas of consciousness science, and in doing so, to lay the foundations for future mathematical work that complements and supports empirical and theoretical work in the further development of this exciting field. (shrink)

In my previous paper I argued that if in vitro fertilization (IVF) is legal and practiced there is no moral ground to object to legalization of preimplantation genetic diagnosis (PGD). My opponent raises an objection that my paper “fails to address the ethical argumentation of one key opponent of IVF – the Catholic Church”. In this reply I show that her/his thesis that embryos created during IVF are in ‘ethical limbo’ and “fall outside the moral universe of Christian (...) ethics” does not undermine my argumentation and masks the serious problem Catholics have with the moral status of early embryos. (shrink)