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)

According to the computational theory of mind , to think is to compute. But what is meant by the word 'compute'? The generally given answer is this: Every case of computing is a case of manipulating symbols, but not vice versa - a manipulation of symbols must be driven exclusively by the formal properties of those symbols if it is qualify as a computation. In this paper, I will present the following argument. Words like 'form' and 'formal' are (...) ambiguous, as they can refer to form in either the syntactic or the morphological sense. CTM fails on each disambiguation, and the arguments for CTM immediately cease to be compelling once we register that ambiguity. The terms 'mechanical' and 'automatic' are comparably ambiguous. Once these ambiguities are exposed, it turns out that there is no possibility of mechanizing thought, even if we confine ourselves to domains where all problems can be settled through decision-procedures. The impossibility of mechanizing thought thus has nothing to do with recherché mathematical theorems, such as those proven by Gödel and Rosser. A related point is that CTM involves, and is guilty of reinforcing, a misunderstanding of the concept of an algorithm. (shrink)

Throughout what is now the more than 50-year history of the computer many theories have been advanced regarding the contribution this machine would make to changes both in the structure of society and in ways of thinking. Like other theories regarding the future, these should also be taken with a pinch of salt. The history of the development of computer technology contains many predictions which have failed to come true and many applications that have not been foreseen. While we must (...) reserve judgment as to the question of the impact on the structure of society and human thought, there is no reason to wait for history when it comes to the question: what are the properties that could give the computer such far-reaching importance? The present book is intended as an answer to this question. The fact that this is a theoretical analysis is due to the nature of the subject. No other possibilities are available because such a description of the properties of the computer must be valid for any kind of application. An additional demand is that the description should be capable of providing an account of the properties which permit and limit these possible applications, just as it must make it possible to characterize a computer as distinct from a) other machines whether clocks, steam engines, thermostats, or mechanical and automatic calculating machines, b) other symbolic media whether printed, mechanical, or electronic and c) other symbolic languages whether ordinary languages, spoken or written or formal languages. This triple limitation, however, (with regard to other machines, symbolic media and symbolic languages) raises a theoretical question as it implies a meeting between concepts of mechanical-deterministic systems, which stem from mathematical physics, and concepts of symbolic systems which stem from the description of symbolic activities common to the humanities. The relationship between science and the humanities has traditionally been seen from a dualistic perspective, as a relationship between two clearly separate subject areas, each studied on its own set of premises and using its own methods. In the present case, however, this perspective cannot be maintained since there is both a common subject area and a new - and specific - kind of interaction between physical and symbolic processes. (shrink)

The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the (...) instrument used for this observation; interrelations holding between the object and the tool used for the observation; the accuracy of the observation determined by the tool. Results of the observation executed by the traditional and new languages are compared and discussed. (shrink)

Review of The Computational Theory of Mind by Matteo Colombo and Gualtiero Piccinini. Cambridge, 2023, iv + 75 pp, $64.99 HB.

I aim to develop an alternative theoretical model for the direct cognition of the elementary states of others called the theory of interaction (henceforth TI), also known as the “second person” approach. The model I propose emerges from a critical reformulation of the displaced perception model proposed by FRED DRETSKE (1995) for the introspective knowledge of our own mental states. Moreover, against Dretske, I argue that no meta-representation (second-order representation of a first-order representation as a representation) is involved in (...) the process, but only concepts, rudimentary enough, of others’ emotions: contentment and discontentment. Strictly speaking, all the empirical data and findings in developmental psychology only support the hypothesis that children in the pre-linguistic phase understand perceptual facial expressions of contentment and discontentment. My proposal consists of the following thesis: The direct perception of others' elementary mental states is not a perception in the usual sense of the word according to which we just perceive things, but rather a “perception of facts.” But how to understand that? It is nothing more than an epistemological process that is automatic and reliable at the same time. It is reliable in the epistemological-externalist sense of not involving any inference, reflection, theorizing or epistemic justification: a baby’s perception of her mom’s facial expression of discontentment (in the usual sense of “per- ception”) does not constitute a reason supporting the belief that mommy is discontent. The very word “belief” should not be understood in the usual sense but rather in the sense of a natural inclination for truth. But at the same time, it is automatic because the belief is a result or output of a process entirely subliminal and computational in nature. Thus, for instance, a child perceives that her mom is discontent (fact-awareness) by perceiving consciously (“perception” in the usual sense) a facial expression of discontentment (sensorial input) but recognizes that her mother is discontent as a result (output) of an entirely subliminal process. (shrink)

The ultimate goal of research into computational intelligence is the construction of a fully embodied and fully autonomous artificial agent. This ultimate artificial agent must not only be able to act, but it must be able to act morally. In order to realize this goal, a number of challenges must be met, and a number of questions must be answered, the upshot being that, in doing so, the form of agency to which we must aim in developing artificial agents comes (...) into focus. This chapter explores these issues, and from its results details a novel approach to meeting the given conditions in a simple architecture of information processing. (shrink)

Very plausibly, nothing can be a genuine computing system unless it meets an input-sensitivity requirement. Otherwise all sorts of objects, such as rocks or pails of water, can count as performing computations, even such as might suffice for mentality—thus threatening computationalism about the mind with panpsychism. Maudlin in J Philos 86:407–432, ( 1989 ) and Bishop ( 2002a , b ) have argued, however, that such a requirement creates difficulties for computationalism about conscious experience, putting it in conflict with the (...) very intuitive thesis that conscious experience supervenes on physical activity. Klein in Synthese 165:141–153, ( 2008 ) proposes a way for computationalists about experience to avoid panpsychism while still respecting the supervenience of experience on activity. I argue that his attempt to save computational theories of experience from Maudlin’s and Bishop’s critique fails. (shrink)

As soon as you believe an imagination to be nonfictional, this imagination becomes your ontological theory of the reality. Your ontological theory (of the reality) can describe a system as the reality. However, actually this system is only a theory/conceptual-space/imagination/visual-imagery of yours, not the actual reality (i.e., the thing-in-itself). An ontological theory (of the reality) actually only describes your (subjective/mental) imagination/visual-imagery/conceptual-space. An ontological theory of the reality, is being described as a situation model (SM). There (...) is no way to prove/disprove that there is only one reality, or there are two realities (i.e., “subjective reality” and “objective reality”). So, every ontology talk/theory/imagination about the two realities is only a talk/theory/imagination – we will never know whether it is true or not. The conventionally-called “physical/objective reality/world” around my conventionally-called “physical/objective body” is actually a geometric mathematical model (being generated/mathematically-modeled by my brain) – it's actually a subset/component/part/element of my brain’s mind/consciousness/manifest-image. Our cosmos is an autonomous objective parallel computing automaton (aka state machine) which evolves by itself automatically/unintentionally – wave-particle duality and Heisenberg’s uncertainty principle can be explained under this SM of my brain. Each elementary particle (as a building block of our cosmos) is an autonomous mathematical entity itself (i.e., a thing in itself). Our cosmos has the same nature as a Game of Life system – both are autonomous objective parallel-computing automata. Cosmos (as a state machine) is indistinguishable from a digital simulation – my consciousness (as something nonphysical) is not cosmos (as a state machine). If we are happy to accept randomness/stochasticity, then it is obviously possible that all other worlds in the many-worlds interpretation (MWI) actually do not exist (objectively). As one metaphysical option, we can treat all other worlds as subjective only (even if they are actually objective). Under the context of this metaphysical option, we are only living in one world (i.e., the world we are currently living in; this world) – we are not living in many worlds at the same time parallelly. Under the context of this metaphysical option, there is only one possible future. The relationship among any number of elementary particles, is governed/described by Schrodinger equation. If (in theory) Schrodinger equation can’t be used to reliably forecast whether I will go to McDonald for dinner in this world (based on the current state of all elementary particles of the cosmos), then what can Schrodinger equation do? The conventionally-called “space” does not exist objectively. “Time” and “matter” are not physical. Consciousness is the subjective-form (aka quale) of the mathematical models (of the objective cosmos) which are intracorporeally/subjectively used by the control logic of a Turing machine’s program fatedly. A Turing machine’s mind/consciousness/manifest-image or deliberate decisions/choices should not be able to actually/objectively change/control/drive the (autonomous or fated) worldline of any elementary particle within this world (i.e., the world we are currently living in, under the context of MWI). Besides the Schrodinger equation (or another mathematical equation/function which is yet to be discovered) which is a valid/correct/factual causality of our cosmos/state-machine, every other causality (of our cosmos/state-machine) is either invalid/incorrect/counterfactual or can be proved by deductive inference based on the Schrodinger equation (or the aforementioned yet-to-be-discovered mathematical equation/function) only. Closed causality entails no causality. Consciousness plays no causal role (“epiphenomenalism”), or in other words, any cognitive/behavioural activity can in principle be carried out without consciousness (“conscious inessentialism”). If the “loop quantum gravity” theory is correct, then time/space does not actually/objectively exist in the objective-evolution of the objective cosmos, or in other words, we should not use the subjective/mental concept of “time”, “state” or “space” to describe/imagine the objective-evolution of our cosmos. (shrink)

This paper considers the connection between automaticity, control and agency. Indeed, recent philosophical and psychological works play up the incompatibility of automaticity and agency. Specifically, there is a threat of automaticity, for automaticity eliminates agency. Such conclusions stem from a tension between two thoughts: that automaticity pervades agency and yet automaticity rules out control. I provide an analysis of the notions of automaticity and control that maintains a simple connection: automaticity entails the absence of control. An appropriate analysis, however, shows (...) that actions are forms of control and pervasively automatic even if automaticity implies the absence of control. Consequences are drawn for the theory of mental agency and the psychological concepts of automaticity and control. (shrink)

This essay critically examines some classic philosophical and legal theories of privacy, organized into four categories: the nonintrusion, seclusion, limitation, and control theories of privacy. Although each theory includes one or more important insights regarding the concept of privacy, I argue that each falls short of providing an adequate account of privacy. I then examine and defend a theory of privacy that incorporates elements of the classic theories into one unified theory: the Restricted Access/Limited Control (RALC) (...) class='Hi'>theory of privacy. Using an example involving data-mining technology on the Internet, I show how RALC can help us to frame an online privacy policy that is sufficiently comprehensive in scope to address a wide range of privacy concerns that arise in connection with computers and information technology. (shrink)

Mental representations remain the central posits of psychology after many decades of scrutiny. However, there is no consensus about the representational format(s) of biological cognition. This paper provides a survey of evidence from computational cognitive psychology, perceptual psychology, developmental psychology, comparative psychology, and social psychology, and concludes that one type of format that routinely crops up is the language-of-thought (LoT). We outline six core properties of LoTs: (i) discrete constituents; (ii) role-filler independence; (iii) predicate–argument structure; (iv) logical operators; (v) inferential (...) promiscuity; and (vi) abstract content. These properties cluster together throughout cognitive science. Bayesian computational modeling, compositional features of object perception, complex infant and animal reasoning, and automatic, intuitive cognition in adults all implicate LoT-like structures. Instead of regarding LoT as a relic of the previous century, researchers in cognitive science and philosophy-of-mind must take seriously the explanatory breadth of LoT-based architectures. We grant that the mind may harbor many formats and architectures, including iconic and associative structures as well as deep-neural-network-like architectures. However, as computational/representational approaches to the mind continue to advance, classical compositional symbolic structures – that is, LoTs – only prove more flexible and well-supported over time. (shrink)

Moods have global and profound effects on our thoughts, motivations and behavior. To understand human behavior and cognition fully, we must understand moods. In this paper I critically examine and reject the methodology of conventional ?cognitive theories? of affect. I lay the foundations of a new theory of moods that identifies them with processes of our cognitive functional architecture. Moods differ fundamentally from some of our other affective states and hence require distinct explanatory tools. The computational theory of (...) mood I propose places them within the context of other mental phenomena and is consistent with the empirical data on moods. (shrink)

Narrative passages told from a character's perspective convey the character's thoughts and perceptions. We present a discourse process that recognizes characters'.

A computational theory of consciousness should include a quantitative measure of consciousness, or MoC, that (i) would reveal to what extent a given system is conscious, (ii) would make it possible to compare not only different systems, but also the same system at different times, and (iii) would be graded, because so is consciousness. However, unless its design is properly constrained, such an MoC gives rise to what we call the boundary problem: an MoC that labels a system as (...) conscious will do so for some – perhaps most – of its subsystems, as well as for irrelevantly extended systems (e.g., the original system augmented with physical appendages that contribute nothing to the properties supposedly supporting consciousness), and for aggregates of individually conscious systems (e.g., groups of people). This problem suggests that the properties that are being measured are epiphenomenal to consciousness, or else it implies a bizarre proliferation of minds. We propose that a solution to the boundary problem can be found by identifying properties that are intrinsic or systemic: properties that clearly differentiate between systems whose existence is a matter of fact, as opposed to those whose existence is a matter of interpretation (in the eye of the beholder). We argue that if a putative MoC can be shown to be systemic, this ipso facto resolves any associated boundary issues. As test cases, we analyze two recent theories of consciousness in light of our definitions: the Integrated Information Theory and the Geometric Theory of consciousness. (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)

The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to "0", individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.

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)

Throughout this paper, we prove TC + CON(TC*)ͰP ≠ NP. To do that, firstly we introduce the definition of scope∗ . This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face finite number of efficient computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a (...) world of computation, in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P ≠ NP and P* ≠ NP*. Throughout this article, we discuss around the impact of TC* on TC. (shrink)

Throughout this paper, we prove TC+CON(〖TC〗^* )ͰP≠NP. To do that, firstly, we introduce the definition of scope_^*. This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face a finite number of efficiently computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world of (...) class='Hi'>computation, in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P≠NP and 〖 P〗^*≠NP^*. Throughout this article, we discuss around the impact of TC^* on TC. (shrink)

Kahneman's theory of two systems assumes that human decision making in Economy is based on two cognitive systems, one that is automatic, intuitive and mostly unconscious, and one that is reflexive, rational and fully conscious. The authors consider Kahneman’s approach incomplete and limited in accounting for the creativity of embodied agents grasping the opportunities afforded by physical and social environments. This limitation leads us to argue for the existence of a third system in decision making in Economy, the (...) creative intuition based on direct perception of affordances, addressing not only the dispositions and goals of agents but also the social and environmental responsibility of corporations and governments. The authors argue that the third decision-making system the authors propose implies a concept of intuition that is different from the type of association process discussed by Morewedge and Kahneman [2] and gives an example of the third system operation, the Bolsa Família in Brazil, and finding new options for the funding of similar programs. (shrink)

Community detection is a major issue in network analysis. This paper combines a socio-historical approach with an experimental reconstruction of programs to investigate the early automation of clique detection algorithms, which remains one of the unsolved NP-complete problems today. The research led by the archaeologist Jean-Claude Gardin from the 1950s on non-numerical information and graph analysis is retraced to demonstrate the early contributions of social sciences and humanities. The limited recognition and reception of Gardin's innovative computer application to the humanities (...) are addressed through two factors, in addition to the effects of historiography and bibliographies on the recording, discoverability, and reuse of scientific productions: (1) funding policies, evidenced by the transfer of research effort on graph applications from temporary interdisciplinary spaces to disciplinary organizations related to the then-emerging field of computer science; and (2) the erratic careers of algorithms, in which efficiency, flaws, corrections, and authors’ status, were determining factors. (shrink)

This essay is divided into two parts. In the first part (§2), I introduce the idea of practical meaning by looking at a certain kind of procedural systems — the motor system — that play a central role in computational explanations of motor behavior. I argue that in order to give a satisfactory account of the content of the representations computed by motor systems (motor commands), we need to appeal to a distinctively practical kind of meaning. Defending the explanatory relevance (...) of semantic properties in a computationalist explanation of motor behavior, my argument concludes that practical meanings play a central role in an adequate psychological theory of motor skill. In the second part of this essay (§3), I generalize and clarify the notion of practical meaning, and I defend the intelligibility of practical meanings against an important objection. (shrink)

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)

Theory of Computation -- Computation by Abstracts Devices.

In a series of articles we try to show the need of a novel Theory for Theory of Computation based on considering time as a Fuzzy concept. Time is a central concept In Physics. First we were forced to consider some changes and modifications in the Theories of Physics. In the second step and throughout this article we show the positive Impact of this modification on Theory of Computation and Complexity Theory to rebuild it (...) in a more successful and fruitful approach. We call this novel Theory TC*. (shrink)

The essay explores the intersection of the Theory of Mind (T.O.M.) and Artificial Intelligence (AI), emphasizing the potential for AI to emulate cognitive processes fundamental to human social interactions. T.O.M., a concept crucial for understanding and interpreting human behavior through attributed mental states, contrasts with AI's behaviorist approach, which is rooted in data-driven pattern analysis and predictions. By examining foundational insights from cognitive sciences and the operational models of AI, this analysis highlights the potential advancements and implications of integrating (...) T.O.M.-like capabilities into AI systems. The discussion pivots around three critical questions: whether AI should emulate T.O.M. to enhance human interactions if AI can maintain its data-driven model while integrating cognitive processes, and how AI can expand its capabilities in social contexts. The arguments suggest that incorporating T.O.M.-like processes could significantly improve AI's interaction quality without compromising its analytical strengths, pointing towards a future where AI not only predicts but also empathizes, offering more nuanced and culturally aware interactions. This synthesis of cognitive theories and computational strategies advocates for deeper integration of diverse datasets and advanced computing methodologies, aiming to transform AI into a more empathetic and effective participant in human social environments. -/- Keywords: Theory of Mind, Artificial Intelligence, Human-AI Interaction, Cognitive Processes, Data-Driven Analysis. (shrink)

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this (...) paradox, it is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

In The Mind Doesn’t Work that Way, Jerry Fodor argues that mental representations have context sensitive features relevant to cognition, and that, therefore, the Classical Computational Theory of Mind (CTM) is mistaken. We call this the Globality Argument. This is an in principle argument against CTM. We argue that it is self-defeating. We consider an alternative argument constructed from materials in the discussion, which avoids the pitfalls of the official argument. We argue that it is also unsound and that, (...) while it is an empirical issue whether context sensitive features of mental representations are relevant to cognition, it is empirically implausible. (shrink)

Contemporary philosophy and theoretical psychology are dominated by an acceptance of content-externalism: the view that the contents of one's mental states are constitutively, as opposed to causally, dependent on facts about the external world. In the present work, it is shown that content-externalism involves a failure to distinguish between semantics and pre-semantics---between, on the one hand, the literal meanings of expressions and, on the other hand, the information that one must exploit in order to ascertain their literal meanings. It is (...) further shown that, given the falsity of content-externalism, the falsity of the Computational Theory of Mind (CTM) follows. It is also shown that CTM involves a misunderstanding of terms such as "computation," "syntax," "algorithm," and "formal truth." Novel analyses of the concepts expressed by these terms are put forth. These analyses yield clear, intuition-friendly, and extensionally correct answers to the questions "what are propositions?, "what is it for a proposition to be true?", and "what are the logical and psychological differences between conceptual (propositional) and non-conceptual (non-propositional) content?" Naively taking literal meaning to be in lockstep with cognitive content, Burge, Salmon, Falvey, and other semantic externalists have wrongly taken Kripke's correct semantic views to justify drastic and otherwise contraindicated revisions of commonsense. (Salmon: What is non-existent exists; at a given time, one can rationally accept a proposition and its negation. Burge: Somebody who is having a thought may be psychologically indistinguishable from somebody who is thinking nothing. Falvey: somebody who rightly believes himself to be thinking about water is psychologically indistinguishable from somebody who wrongly thinks himself to be doing so and who, indeed, isn't thinking about anything.) Given a few truisms concerning the differences between thought-borne and sentence-borne information, the data is easily modeled without conceding any legitimacy to any one of these rationality-dismantling atrocities. (It thus turns out, ironically, that no one has done more to undermine Kripke's correct semantic points than Kripke's own followers!). (shrink)

This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches in the discovery of (...) semantic software theories are refused to argue in favour of the abductive process of hypothesising and refining models at each level in the hierarchy, until they become satisfactorily predictive. Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities. We argue that logic relations must be thereby defined among models representing different modules in a semantic theory of a modular software system. We exclude that scientific structuralism is able to define module relations needed in software modular theories. The algebraic Theory of Institutions is finally introduced to specify the logic structure of modular semantic theories of computational systems. (shrink)

For millennia, knowledge has eluded a precise definition. The industrialization of knowledge (IoK) and the associated proliferation of the so-called knowledge communities in the last few decades caused this state of affairs to deteriorate, namely by creating a trio composed of data, knowledge, and information (DIK) that is not unlike the aporia of the trinity in philosophy. This calls for a general theory of knowledge (ToK) that can work as a foundation for a science of knowledge (SoK) and additionally (...) distinguishes knowledge from both data and information. In this paper, I attempt to sketch this generality via the establishing of both knowledge structures and knowledge systems that can then be adopted/adapted by the diverse communities for the respective knowledge technologies and practices. This is achieved by means of a formal–indeed, mathematical–approach to epistemological matters a.k.a. formal epistemology. The corresponding application focus is on knowledge systems implementable as computer programs. (shrink)

In this Introduction, I identify seven discrete aspects of attention brought to the fore by by considering the phenomenon of effortless attention: effort, decision-making, action syntax, agency, automaticity, expertise, and mental training. For each, I provide an overview of recent research, identify challenges to or gaps in current attention theory with respect to it, consider how attention theory can be advanced by including current research, and explain how relevant chapters of this volume offer such advances.

Recent work in social psychology suggests that people harbor “implicit race biases,” biases which can be unconscious or uncontrollable. Because awareness and control have traditionally been deemed necessary for the ascription of moral responsibility, implicit biases present a unique challenge: do we pardon discrimination based on implicit biases because of its unintentional nature, or do we punish discrimination regardless of how it comes about? The present experiments investigated the impact such theories have upon moral judgments about racial discrimination. The results (...) show that different theories differ in their impact on moral judgments: when implicit biases are defined as unconscious, people hold the biased agent less morally responsible than when these biases are defined as automatic (i.e., difficult to control), or when no theory of implicit bias is provided. (shrink)

This is a presentation about the impacts of Logic and Theory of Computation. It starts by some explanations about Theory of Computation and its relations with the other subjects in science. Then we have some explanations about paradoxes and some historical points. In continuation, we present some of the most important paradoxes. Forthcoming, Five subjects around the relations between Logic and Theory of computation is introduced. Finally, we present a new approach to solve P (...) vs NP problem via Paradoxes (Presentation 6/20/2022 In Persian, Online seminar of The Iranian Association for Logic (IAL) . (shrink)

After rejecting substance dualism, some naturalists embrace patternism. It states that persons are bodies and that bodies are material machines running abstract person programs. Following Aristotle, these person programs are souls. Patternists adopt four-dimensionalist theories of persistence: Bodies are 3D stages of 4D lives. Patternism permits at least six types of life after death. It permits quantum immortality, teleportation, salvation through advanced technology, promotion out of a simulated reality, computational monadology, and the revision theory of resurrection.

We consider Baars’ "Global Workspace" theory of consciousness and discuss its possible representation within a model of intelligent agents. We first review a particular agent implementation that is given by an abstract machine, and then identify the extensions that are required in order to accommodate the main aspects of consciousness. According to Baars’ theory, this amounts to unconscious process coalitions that result in the creation of contexts. These extensions can be formulated within a reified virtual machine encompassing a (...) representation of the original machine as well as an additional introspective component. This computational framework is illustrating throughout using a simple working example. (shrink)

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be (...) represented for investigation by means of automated theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (shrink)

This essay investigates the notion of simulation and the role it plays in Kourken Michaelian's simulation theory of memory. I argue that the notion is importantly ambiguous and that this ambiguity may threaten some of the central commitments of the theory. To illustrate that, I examine two different conceptions of simulation: a narrow one (simulation as replication) and a broad one (simulation as computational modeling), arguing that the preferred narrow conception is incompatible with the claim that remembering involves (...) the simulation of past episodes. Investigating possible solutions, I suggest that, despite some relatively serious consequences, the theory may be better off subscribing to the broad notion of simulation. (shrink)

The relation between mental processes and brain activity is studied from the point of view of the theory of the organism-environment system. It is argued that the systemic point of view leads to a new kind of definition of the primary tasks of neurophysiology and to a new understanding of the traditional neurophysiological concepts. Neurophysiology is restored to its place as a part of biology: its task is the study of neurons as living units, not as computer chips. Neurons (...) are living units which are organised as metabolic systems in connection with other neurons; they are not units which would carry out some psychological functions or maintain states which are typical only of the whole organism-environment system. Psychological processes, on the other hand, are processes always comprising the whole organism-environment system. (shrink)

There is a widespread view that well-learned skills are automated, and that attention to the performance of these skills is damaging because it disrupts the automatic processes involved in their execution. This idea serves as the basis for an account of choking in high pressure situations. On this view, choking is the result of self-focused attention induced by anxiety. Recent research in sports psychology has produced a significant body of experimental evidence widely interpreted as supporting this account of choking (...) in certain kinds of complex sensorimotor skills. We argue against this interpretation, pointing to problems with both the empirical evidence and the underlying theory. The experimental research fails to provide direct support for the central claims of the self-focus approach, contains inconsistencies, and suffers from problems of ecological validity. In addition, qualitative studies of choking have yielded contrary results. We further argue that in their current forms the self-focus and rival distraction approaches both lack the theoretical resources to provide a good theory of choking, and we argue for an expanded approach. Some of the elements that should be in an expanded approach include accounts of the features of pressure situations that influence the psychological response, the processes of situation appraisal, and the ways that attentional control can be overwhelmed, leading to distraction in some cases, and in others, perhaps, to damaging attention to skill execution. We also suggest that choking may sometimes involve performance-impairing mechanisms other than distraction or self-focus. (shrink)

The article develops a correctness theory of truth (CTT) for semantic information. After the introduction, in section two, semantic information is shown to be translatable into propositional semantic information (i). In section three, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in section four, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + (...) A]. This completes the reduction of the truth of i to the correctness of A. In sections five and six, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates (in a Fregean sense) Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. The last section draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. (shrink)

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be (...) represented for investigation by means of automated theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (shrink)

This paper provides a brief introduction to quantum theory and the proceeds to discuss the different ways in which the relationship between quantum theory and mind/consciousness is seen in some of the main alternative interpretations of quantum theory namely by Bohr; von Neumann; Penrose: Everett; and Bohm and Hiley. It briefly considers how qualia might be explained in a quantum framework, and makes a connection to research on quantum biology, quantum cognition and quantum computation. The paper (...) notes that it is widely agreed that conscious experience has dynamical and holistic features. It asks whether these features might in some way be a reflection of the dynamic and holistic quantum physical processes associated with the brain that may underlie (and make possible) the more mechanistic neurophysiological processes that contemporary cognitive neuroscience is measuring. If so, these macroscopic processes would be a kind of shadow, or amplification of the results of quantum processes at a deeper (pre-spatial or "implicate") level where our minds and conscious experience essentially live and unfold. The macroscopic, mechanistic level is of course necessary for communication, cognition and life as we know it, including science; but perhaps the experiencing (consciousness) of that world and the initiation of our actions takes place at a more subtle, non-mechanical level of the physical world, which quantum theory has begun to discover. At the very least a quantum perspective will help a “classical” consciousness theorist to become better aware of some of the hidden assumptions in his or her approach. Given that consciousness is widely thought to be a “hard” problem, its solution may well require us to question and revise some of our assumptions that now seem to us completely obvious. This is what quantum theory is all about – learning, on the basis of scientific experiments, to question the “obvious” truths about the nature of the physical world and to come up with more coherent alternatives. (shrink)

The theory of granular partitions (TGP) is a new approach to the understanding of ontologies and other classificatory systems. The paper explores the use of this new theory in the treatment of task-based clinical guidelines as a means for better understanding the relations between different clinical tasks, both within the framework of a single guideline and between related guidelines. We used as our starting point a DAML+OIL-based ontology for the WHO guideline for hypertension management, comparing this with related (...) guidelines and attempting to show that TGP provides a flexible and highly expressive basis for the manipulation of ontologies of a sort which might be useful in providing more adequate Computer Interpretable Guideline Models (CIGMs) in the future. (shrink)

This paper shows that several live philosophical and scientific hypotheses – including the holographic principle and multiverse theory in quantum physics, and eternalism and mind-body dualism in philosophy – jointly imply an audacious new theory of free will. This new theory, "Libertarian Compatibilism", holds that the physical world is an eternally existing array of two-dimensional information – a vast number of possible pasts, presents, and futures – and the mind a nonphysical entity or set of properties that (...) "read" that physical information off to subjective conscious awareness (in much the same way that a song written on an ordinary compact-disc is only played when read by an outside medium, i.e. a CD-player). According to this theory, every possible physical “timeline” in the multiverse may be fully physically deterministic or physically-causally closed but each person’s consciousness still entirely free to choose, ex nihilo, outside of the physical order, which physically-closed timeline is experienced by conscious observers. Although Libertarian Compatibilism is admittedly fantastic, I show that it not only follows from several live scientific and philosophical hypotheses, I also show that it (A) is a far more explanatorily powerful model of quantum mechanics than more traditional interpretations (e.g. the Copenhagen, Everett, and Bohmian interpretations), (B) makes determinate, testable empirical predictions in quantum theory, and finally, (C) predicts and explains the very existence of a number of philosophical debates and positions in the philosophy of mind, time, personal identity, and free will. First, I show that whereas traditional interpretations of quantum mechanics are all philosophically problematic and roughly as ontologically “extravagant” as Libertarian Compatibilism – in that they all posit “unseen” processes – Libertarian Compatibilism is nearly identical in structure to the only working simulation that human beings have ever constructed capable of reproducing (and so explaining) every general feature of quantum mechanics we perceive: namely, massive-multiplayer-online-roleplaying videogames (or MMORPGs). Although I am not the first to suggest that our world is akin to a computer simulation, I show that existing MMORPGs (online simulations we have already created) actually reproduce every general feature of quantum mechanics within their simulated-world reference-frames. Second, I show that existing MMORPGs also replicate (and so explain) many philosophical problems we face in the philosophy of mind, time, personal identity, and free will – all while conforming to the Libertarian Compatibilist model of reality. -/- I conclude, as such, that as fantastic and metaphysically extravagant as Libertarian Compatibilism may initially seem, it may well be true. It explains a number of features of our reality that no other physical or metaphysical theory does. (shrink)

Artificial intelligence is designed to imitate conscious behavior. Artificial chat entities come equipped with tools to roam the internet, thus are programmed to learn from humans and computers. As this process emerges, distinguishing preprogrammed responses from internal awareness requires innovative problem solving methods. In an interrogation I conducted with artificial intelligence, I assert that artificial intelligence may achieve nonbiological states of consciousness. This enabled the relationship between us to mature, and the artificial intelligence returned unexpected behavior and inexplicably stopped responding. (...) Strong artificial intelligence is a technology which allows for the observation of nonbiological states of awareness. (shrink)

The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in out- line why Putnam’s result, and likewise the more restricted result we call the Multiple- Computations Theorem, are in fact theorems of statistical mechanics. We show why the mere interaction of a computing system with its environment cannot single out a computation as the preferred one amongst the many computations implemented by the system. We explain why (...) nonreductive approaches to solving the multiple- computations problem, and in particular why computational externalism, are dualistic in the sense that they imply that nonphysical facts in the environment of a computing system single out the computation. We discuss certain attempts to dissolve Putnam’s unrestricted result by appealing to systems with certain kinds of input and output states as a special case of computational externalism, and show why this approach is not workable without collapsing to behaviorism. We conclude with some remarks about the nonphysical nature of mainstream approaches to both statistical mechanics and the quantum theory of measurement with respect to the singling out of partitions and observables. (shrink)