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.

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)

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)

One of the possible hypotheses about time is to consider any instant of time as a fuzzy number so that two instances of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas. Brouwer and Husserl are two examples. This article studies the impact of this change on the Theory of Computation and Complexity Theory. In order to rebuild the Theory of Computation in a more successful and productive approach to solve some (...) major problems in Complexity Theory, the present research is done. This novel theory is called here, the fuzzy time theory of computation, TC*. Here, we show the situation of some major problems in Complexity theory and Quantum complexity theory in the new model, and how some major problems would be solved. (shrink)

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)

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)

The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second recursion theorem, I (...) prove that it is mathematically possible for us to be in a simulation that is being run on a computer \textit{by us}. In such a case, there would be two identical instances of us; the question of which of those is ``really us'' is meaningless. I also show how Rice's theorem provides some interesting impossibility results concerning simulation and self-simulation; briefly describe the philosophical implications of fully homomorphic encryption for (self-)simulation; briefly investigate the graphical structure of universes simulating universes simulating universes, among other issues. I end by describing some of the possible avenues for future research that this preliminary investigation reveals. (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 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)

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)

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

There is a thesis often aired by some philosophers of psychology that syntax is all we need and there is no need to advert to intentional/semantic properties of symbols for purposes of psychological explanation. Indeed, the worry has been present since the first explicit articulation of so-called Computational Theory of Mind (CTM). Even Fodor, who has been the most ardent defender of the Language of Thought Hypoth- esis (LOTH) (which requires the CTM), has raised worries about its apparent consequences. (...) The worry can be put in the form of a question, which Fodor called the. (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 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 the impact of TC* on TC. -/- . (shrink)

While Thomas Kuhn's theory of scientific revolutions does not specifically deal with validation, the validation of simulations can be related in various ways to Kuhn's theory: 1) Computer simulations are sometimes depicted as located between experiments and theoretical reasoning, thus potentially blurring the line between theory and empirical research. Does this require a new kind of research logic that is different from the classical paradigm which clearly distinguishes between theory and empirical observation? I argue that this (...) is not the case. 2) Another typical feature of computer simulations is their being ``motley'' (Winsberg 2003) with respect to the various premises that enter into simulations. A possible consequence is that in case of failure it can become difficult to tell which of the premises is to blame. Could this issue be understood as fostering Kuhn's mild relativism with respect to theory choice? I argue that there is no need to worry about relativism with respect to computer simulations, in particular. 3) The field of social simulations, in particular, still lacks a common understanding concerning the requirements of empirical validation of simulations. Does this mean that social simulations are still in a pre-scientific state in the sense of Kuhn? My conclusion is that despite ongoing efforts to promote quality standards in this field, lack of proper validation is still a problem of many published simulation studies and that, at least large parts of social simulations must be considered as pre-scientific. (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)

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)

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)

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

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)

Theory of Computation -- Computation by Abstracts Devices.

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)

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)

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the (...) class='Hi'>computation, and even independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility,incompleteness, the limits of computation,and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things,a non-quantum mechanical uncertainty principle and a proof of monotheism. (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)

Moral reasoning traditionally distinguishes two types of evil: moral and natural. The standard view is that ME is the product of human agency and so includes phenomena such as war, torture and psychological cruelty; that NE is the product of nonhuman agency, and so includes natural disasters such as earthquakes, floods, disease and famine; and finally, that more complex cases are appropriately analysed as a combination of ME and NE. Recently, as a result of developments in autonomous agents in cyberspace, (...) a new class of interesting and important examples of hybrid evil has come to light. In this paper, it is called artificial evil and a case is made for considering it to complement ME and NE to produce a more adequate taxonomy. By isolating the features that have led to the appearance of AE, cyberspace is characterised as a self-contained environment that forms the essential component in any foundation of the emerging field of Computer Ethics. It is argued that this goes some way towards providing a methodological explanation of why cyberspace is central to so many of CE’s concerns; and it is shown how notions of good and evil can be formulated in cyberspace. Of considerable interest is how the propensity for an agent’s action to be morally good or evil can be determined even in the absence of biologically sentient participants and thus allows artificial agents not only to perpetrate evil but conversely to ‘receive’ or ‘suffer from’ it. The thesis defended is that the notion of entropy structure, which encapsulates human value judgement concerning cyberspace in a formal mathematical definition, is sufficient to achieve this purpose and, moreover, that the concept of AE can be determined formally, by mathematical methods. A consequence of this approach is that the debate on whether CE should be considered unique, and hence developed as a Macroethics, may be viewed, constructively, in an alternative manner. The case is made that whilst CE issues are not uncontroversially unique, they are sufficiently novel to render inadequate the approach of standard Macroethics such as Utilitarianism and Deontologism and hence to prompt the search for a robust ethical theory that can deal with them successfully. The name Information Ethics is proposed for that theory. It is argued that the uniqueness of IE is justified by its being non-biologically biased and patient-oriented: IE is an Environmental Macroethics based on the concept of data entity rather than life. It follows that the novelty of CE issues such as AE can be appreciated properly because IE provides a new perspective. In light of the discussion provided in this paper, it is concluded that Computer Ethics is worthy of independent study because it requires its own application-specific knowledge and is capable of supporting a methodological foundation, Information Ethics. (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)

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 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)

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 essential difficulty about Computer Ethics' (CE) philosophical status is a methodological problem: standard ethical theories cannot easily be adapted to deal with CE-problems, which appear to strain their conceptual resources, and CE requires a conceptual foundation as an ethical theory. Information Ethics (IE), the philosophical foundational counterpart of CE, can be seen as a particular case of environmental ethics or ethics of the infosphere. What is good for an information entity and the infosphere in general? This is the (...) ethical question asked by IE. The answer is provided by a minimalist theory of deseerts: IE argues that there is something more elementary and fundamental than life and pain, namely being, understood as information, and entropy, and that any information entity is to be recognised as the centre of a minimal moral claim, which deserves recognition and should help to regulate the implementation of any information process involving it. IE can provide a valuable perspective from which to approach, with insight and adequate discernment, not only moral problems in CE, but also the whole range of conceptual and moral phenomena that form the ethical discourse. (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.

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing (...) the computation, and even independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility, incompleteness, the limits of computation, and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things, a non- quantum mechanical uncertainty principle and a proof of monotheism. There are obvious connections to the classic work of Chaitin, Solomonoff, Komolgarov and Wittgenstein and to the notion that no program (and thus no device) can generate a sequence (or device) with greater complexity than it possesses. One might say this body of work implies atheism since there cannot be any entity more complex than the physical universe and from the Wittgensteinian viewpoint, ‘more complex’ is meaningless (has no conditions of satisfaction, i.e., truth-maker or test). Even a ‘God’ (i.e., a ‘device’with limitless time/space and energy) cannot determine whether a given ‘number’ is ‘random’, nor find a certain way to show that a given ‘formula’, ‘theorem’ or ‘sentence’ or ‘device’ (all these being complex language games) is part of a particular ‘system’. -/- Those wishing a comprehensive up to date framework for human behavior from the modern two systems view may consult my book ‘The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle’ 2nd ed (2019). Those interested in more of my writings may see ‘Talking Monkeys--Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet--Articles and Reviews 2006-2019 2nd ed (2019) and Suicidal Utopian Delusions in the 21st Century 4th ed (2019) . (shrink)

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)

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)

मैं कंप्यूटर के रूप में गणना और ब्रह्मांड की सीमा के कई हाल ही में चर्चा पढ़ लिया है, polymath भौतिक विज्ञानी और निर्णय सिद्धांतकार डेविड Wolpert के अद्भुत काम पर कुछ टिप्पणी खोजने की उम्मीद है, लेकिन एक भी प्रशस्ति पत्र नहीं मिला है और इसलिए मैं यह बहुत संक्षिप्त मौजूद सारांश. Wolpert कुछ आश्चर्यजनक असंभव या अधूरापन प्रमेयों साबित कर दिया (1992 से 2008-देखें arxiv dot org) अनुमान के लिए सीमा पर (कम्प्यूटेशन) कि इतने सामान्य वे गणना कर (...) डिवाइस से स्वतंत्र हैं, और यहां तक कि भौतिकी के नियमों से स्वतंत्र, इसलिए वे कंप्यूटर, भौतिक विज्ञान और मानव व्यवहार में लागू होते हैं. वे कैंटर विकर्णीकरण का उपयोग करते हैं, झूठा विरोधाभास और worldlines प्रदान करने के लिए क्या ट्यूरिंग मशीन थ्योरी में अंतिम प्रमेय हो सकता है, और प्रतीत होता है असंभव, अधूरापन, गणना की सीमा में अंतर्दृष्टि प्रदान करते हैं, और ब्रह्मांड के रूप में कंप्यूटर, सभी संभव ब्रह्मांडों और सभी प्राणियों या तंत्र में, उत्पादन, अन्य बातों के अलावा, एक गैर क्वांटम यांत्रिक अनिश्चितता सिद्धांत और एकेश्वरवाद का सबूत. वहाँ Chaitin, Solomonoff, Komolgarov और Wittgenstein के क्लासिक काम करने के लिए स्पष्ट कनेक्शन कर रहे हैं और धारणा है कि कोई कार्यक्रम (और इस तरह कोई डिवाइस) एक दृश्य उत्पन्न कर सकते हैं (या डिवाइस) अधिक से अधिक जटिलता के साथ यह पास से. कोई कह सकता है कि काम के इस शरीर का अर्थ नास्तिकता है क्योंकि भौतिक ब्रह्मांड से और विटगेनस्टीनियन दृष्टिकोण से कोई भी इकाई अधिक जटिल नहीं हो सकती है, 'अधिक जटिल' अर्थहीन है (संतोष की कोई शर्त नहीं है, अर्थात, सत्य-निर्माता या परीक्षण)। यहां तक कि एक 'भगवान' (यानी, असीम समय/स्थान और ऊर्जा के साथ एक 'डिवाइस' निर्धारित नहीं कर सकता है कि क्या एक दिया 'संख्या' 'यादृच्छिक' है, और न ही एक निश्चित तरीका है दिखाने के लिए कि एक दिया 'सूत्र', 'प्रमेय' या 'वाक्य' या 'डिवाइस' (इन सभी जटिल भाषा जा रहा है) खेल) एक विशेष 'प्रणाली' का हिस्सा है. आधुनिक दो systems दृश्यसे मानव व्यवहार के लिए एक व्यापक अप करने के लिए तारीख रूपरेखा इच्छुक लोगों को मेरी पुस्तक 'दर्शन, मनोविज्ञान, मिनडी और लुडविगमें भाषा की तार्किक संरचना से परामर्श कर सकते हैं Wittgenstein और जॉन Searle '2 एड (2019). मेरे लेखन के अधिक में रुचि रखने वालों को देख सकते हैं 'बात कर रहेबंदर- दर्शन, मनोविज्ञान, विज्ञान, धर्म और राजनीति पर एक बर्बाद ग्रह --लेख और समीक्षा 2006-2019 2 ed (2019) और आत्मघाती यूटोपियान भ्रम 21st मेंसदी 4वें एड (2019) . (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 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)

The aim of this paper is to describe and analyze the epistemological justification of a proposal initially made by the biomathematician Robert Rosen in 1958. In this theoretical proposal, Rosen suggests using the mathematical concept of “category” and the correlative concept of “natural equivalence” in mathematical modeling applied to living beings. Our questions are the following: According to Rosen, to what extent does the mathematical notion of category give access to more “natural” formalisms in the modeling of living beings? Is (...) the so -called “naturalness” of some kinds of equivalences (which the mathematical notion of category makes it possible to generalize and to put at the forefront) analogous to the naturalness of living systems? Rosen appears to answer “yes” and to ground this transfer of the concept of “natural equivalence” in biology on such an analogy. But this hypothesis, although fertile, remains debatable. Finally, this paper makes a brief account of the later evolution of Rosen’s arguments about this topic. In particular, it sheds light on the new role played by the notion of “category” in his more recent objections to the computational models that have pervaded almost every domain of biology since the 1990s. (shrink)

The classical theory of computation does not represent an adequate model of reality for simulation in the social sciences. The aim of this paper is to construct a methodological perspective that is able to conciliate the formal and empirical logic of program verification in computer science, with the interpretative and multiparadigmatic logic of the social sciences. We attempt to evaluate whether social simulation implies an additional perspective about the way one can understand the concepts of program and (...) class='Hi'>computation. We demonstrate that the logic of social simulation implies at least two distinct types of program verifications that reflect an epistemological distinction in the kind of knowledge one can have about programs. Computer programs seem to possess a causal capability (Fetzer, 1999) and an intentional capability that scientific theories seem not to possess. This distinction is associated with two types of program verification, which we call empirical and intentional verification. We demonstrate, by this means, that computational phenomena are also intentional phenomena, and that such is particularly manifest in agent-based social simulation. Ascertaining the credibility of results in social simulation requires a focus on the identification of a new category of knowledge we can have about computer programs. This knowledge should be considered an outcome of an experimental exercise, albeit not empirical, acquired within a context of limited consensus. The perspective of intentional computation seems to be the only one possible to reflect the multiparadigmatic character of social science in terms of agent-based computational social science. We contribute, additionally, to the clarification of several questions that are found in the methodological perspectives of the discipline, such as the computational nature, the logic of program scalability, and the multiparadigmatic character of agent-based simulation in the social sciences. (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)

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that (...) representational content is extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (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)

One particularly successful approach to modeling within cognitive science is computational psychology. Computational psychology explores psychological processes by building and testing computational models with human data. In this paper, it is argued that a specific approach to understanding computation, what is called the ‘narrow conception’, has problematically limited the kinds of models, theories, and explanations that are offered within computational psychology. After raising two problems for the narrow conception, an alternative, ‘wide approach’ to computational psychology is proposed.

Moral reasoning traditionally distinguishes two types of evil:moral (ME) and natural (NE). The standard view is that ME is the product of human agency and so includes phenomena such as war,torture and psychological cruelty; that NE is the product of nonhuman agency, and so includes natural disasters such as earthquakes, floods, disease and famine; and finally, that more complex cases are appropriately analysed as a combination of ME and NE. Recently, as a result of developments in autonomous agents in cyberspace, (...) a new class of interesting and important examples of hybrid evil has come to light. In this paper, it is called artificial evil (AE) and a case is made for considering it to complement ME and NE to produce a more adequate taxonomy. By isolating the features that have led to the appearance of AE, cyberspace is characterised as a self-contained environment that forms the essential component in any foundation of the emerging field of Computer Ethics (CE). It is argued that this goes someway towards providing a methodological explanation of why cyberspace is central to so many of CE's concerns; and it is shown how notions of good and evil can be formulated in cyberspace. Of considerable interest is how the propensity for an agent's action to be morally good or evil can be determined even in the absence of biologically sentient participants and thus allows artificial agents not only to perpetrate evil (and fort that matter good) but conversely to `receive' or `suffer from' it. The thesis defended is that the notion of entropy structure, which encapsulates human value judgement concerning cyberspace in a formal mathematical definition, is sufficient to achieve this purpose and, moreover, that the concept of AE can be determined formally, by mathematical methods. A consequence of this approach is that the debate on whether CE should be considered unique, and hence developed as a Macroethics, may be viewed, constructively,in an alternative manner. The case is made that whilst CE issues are not uncontroversially unique, they are sufficiently novel to render inadequate the approach of standard Macroethics such as Utilitarianism and Deontologism and hence to prompt the search for a robust ethical theory that can deal with them successfully. The name Information Ethics (IE) is proposed for that theory. Itis argued that the uniqueness of IE is justified by its being non-biologically biased and patient-oriented: IE is an Environmental Macroethics based on the concept of data entity rather than life. It follows that the novelty of CE issues such as AE can be appreciated properly because IE provides a new perspective (though not vice versa). In light of the discussion provided in this paper, it is concluded that Computer Ethics is worthy of independent study because it requires its own application-specific knowledge and is capable of supporting a methodological foundation, Information Ethics. (shrink)

The study sought to find out the role of computer technology in music education in Colleges of Education in the Volta Region of Ghana. It aimed at surveying the use of computer technology for teaching music and exploring the instructional prospects for computer technology usage in music in Colleges of Education. The study employed Rogers’ Diffusion Innovation theory and descriptive survey research method. Data was collected from the respondents using questionnaire, interview, and observation. The study revealed that even though (...) about 90% of the music tutors have good academic qualification and over five years teaching experience, lack of competence in handling computer technology in teaching music among some music tutors and incoherent ICT initiatives hindered proper application of computer technology in the field of music education. It is however envisaged that increasing access and coherent computer technology initiatives will be paramount for the teaching of music in the Colleges of Education. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as (...) computational models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order (classical) systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

The theory and philosophy of artificial intelligence has come to a crucial point where the agenda for the forthcoming years is in the air. This special volume of Minds and Machines presents leading invited papers from a conference on the “Philosophy and Theory of Artificial Intelligence” that was held in October 2011 in Thessaloniki. Artificial Intelligence is perhaps unique among engineering subjects in that it has raised very basic questions about the nature of computing, perception, reasoning, learning, language, (...) action, interaction, consciousness, humankind, life etc. etc. – and at the same time it has contributed substantially to answering these questions. There is thus a substantial tradition of work, both on AI by philosophers and of theory within AI itself. - The volume contains papers by Bostrom, Dreyfus, Gomila, O'Regan and Shagrir. (shrink)

我最近读过许多关于计算极限和宇宙作为计算机的讨论,希望找到一些关于多面体物理学家和决策理论家大卫·沃尔珀特的惊人工作的评论,但没有发现一个引文,所以我提出这个非常简短的总结。Wolpert 证明了一些惊人的不可能或不完整的定理(1992-2008-见arxiv dot org)对推理(计算)的限制,这些极限非常一般,它们独立于执行计算的设备,甚至独立于物理定律,因此,它们适用于计算机、物理和人类行为。他们利用Cantor的对角线、骗子悖论和世界线来提供图灵机器理论的 终极定理,并似乎提供了对不可能、不完整、计算极限和宇宙的见解。计算机,在所有可能的宇宙和所有生物或机制,产生,除其他外,非量子力学不确定性原理和一神论的证明。与柴廷、所罗门诺夫、科莫尔加罗夫和维特根斯 坦的经典作品以及任何程序(因此没有设备)能够生成比它拥有的更大复杂性的序列(或设备)的概念有着明显的联系。有人可能会说,这一工作意味着无政府主义,因为没有比物质宇宙更复杂的实体,从维特根斯坦的观点来看 ,"更复杂的"是毫无意义的(没有满足的条件,即真理制造者或测试)。即使是"上帝"(即具有无限时间/空间和能量的"设备")也无法确定给定的&q uot;数字"是否为"随机",也无法找到某种方式来显示给定的"公式"、"定理"或"句子"或"设备&q uot;(所有这些语言都是复杂的语言)游戏)是特定"系统"的一部分。 那些希望从现代两个系统的观点来看为人类行为建立一个全面的最新框架的人,可以查阅我的书《路德维希的哲学、心理学、Mind 和语言的逻辑结构》维特根斯坦和约翰·西尔的《第二部》(2019年)。那些对我更多的作品感兴趣的人可能会看到《会说话的猴子——一个末日星球上的哲学、心理学、科学、宗教和政治——文章和评论2006-201 9年第二次(2019年)》和《自杀乌托邦幻想》第21篇世纪4日 (2019).

Psychology endeavors to develop theories of human capacities and behaviors on the basis of a variety of methodologies and dependent measures. We argue that one of the most divisive factors in psychological science is whether researchers choose to use computational modeling of theories (over and above data) during the scientific-inference process. Modeling is undervalued yet holds promise for advancing psychological science. The inherent demands of computational modeling guide us toward better science by forcing us to conceptually analyze, specify, and formalize (...) intuitions that otherwise remain unexamined—what we dub open theory. Constraining our inference process through modeling enables us to build explanatory and predictive theories. Here, we present scientific inference in psychology as a path function in which each step shapes the next. Computational modeling can constrain these steps, thus advancing scientific inference over and above the stewardship of experimental practice (e.g., preregistration). If psychology continues to eschew computational modeling, we predict more replicability crises and persistent failure at coherent theory building. This is because without formal modeling we lack open and transparent theorizing. We also explain how to formalize, specify, and implement a computational model, emphasizing that the advantages of modeling can be achieved by anyone with benefit to all. (shrink)