Although formal thought disorder (FTD) has been for long a clinical label in the assessment of some psychiatric disorders, in particular of schizophrenia, it remains a source of controversy, mostly because it is hard to say what exactly the “formal” in FTD refers to. We see anomalous processing of terminological knowledge, a core construct of human knowledge in general, behind FTD symptoms and we approach this anomaly from a strictly formal perspective. More specifically, we present here a symbolic computational (...) model of storage in, and activation of, a human semantic network, or semantic memory, whose core element is logical form; this is normalized by description logic (DL), namely by CL, a DL-based language – Conception Language – designed to formalize conceptualization from the viewpoint of individual cognitive agency. In this model, disruptions in the rule-based implementation of the logical form account for the apparently semantic anomalies symptomatic of FTD, which are detected by means of a CL-based algorithmic assessment. (shrink)

The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior (...) to symbol grounding. In this case, no symbol grounding could take place since any grounding presupposes intentional cognitive processes. So, whether computing in the mind is over meaningless or over meaningful symbols, computationalism implies semantic nativism. (shrink)

This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in human history, even at moments in the distant future, this set (...) is finite. But then, given fundamental results in recursion theory, the set will also be recursive, recursively enumerable, axiomatizable, and could be the output of a Turing machine. We then argue that it is impossible to produce a string of symbols that humans could possibly produce but no Turing machine could. Moreover, we show that any given string of symbols that we could produce could also be the output of a Turing machine. Our arguments have implications for Hilbert’s sixth problem and the possibility of axiomatizing particular sciences, they undermine at least two distinct arguments against the possibility of Artificial Intelligence, and they entail that expert systems that are the equals of human experts are possible, and so at least one of the goals of Artificial Intelligence can be realized, at least in principle. (shrink)

There are two versions of the language-of-thought hypothesis (LOT): Representational LOT (roughly, structured representation), introduced by Ockham, and computational LOT (roughly, symbolic computation) introduced by Fodor. Like many others, I oppose the latter but not the former. Quilty-Dunn et al. defend representational LOT, but they do not defend the strong computational LOT thesis central to the classical-connectionist debate.

Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, Searle's Chinese room (...) (1980) and arguments from Gödel's Incompleteness theorems (e.g., Lucas, 1961; Penrose, 1989), both of which fall short of addressing the complete TM model. Both UTM-computers and formal systems provide an unsound basis for debate. In particular, their special natures easily foster the misconception that computation entails intrinsically meaningless symbol manipulation. This common view is incorrect with respect to full-fledged TM's, which can process inputs non-formally, i.e., in a subjective and dynamically evolving fashion. To avoid a distorted understanding of the theory of computation, philosophical judgments and discussions should be grounded firmly upon the complete Turing machine model, the proper model for real computers. (shrink)

In this paper, we deal with the computation of Lie derivatives, which are required, for example, in some numerical methods for the solution of differential equations. One common way for computing them is to use symbolic computation. Computer algebra software, however, might fail if the function is complicated, and cannot be even performed if an explicit formulation of the function is not available, but we have only an algorithm for its computation. An alternative way to address the problem (...) is to use automatic differentiation. In this case, we only need the implementation of the algorithm that evaluates the function in terms of its analytic expression in a programming language, but we cannot use this if we have only a compiled version of the function. In this paper, we present a novel approach for calculating the Lie derivative of a function, even in the case where its analytical expression is not available, that is based on the In finity Computer arithmetic. A comparison with symbolic and automatic differentiation shows the potentiality of the proposed technique. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have (...) been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

Modern semiotics is a branch of logics that formally defines symbol-based communication. In recent years, the semiotic classification of signs has been invoked to support the notion that symbols are uniquely human. Here we show that alarm-calls such as those used by African vervet monkeys (Cercopithecus aethiops), logically satisfy the semiotic definition of symbol. We also show that the acquisition of vocal symbols in vervet monkeys can be successfully simulated by a computer program based on minimal semiotic and neurobiological constraints. (...) The simulations indicate that learning depends on the tutor-predator ratio, and that apprentice-generated auditory mistakes in vocal symbol interpretation have little effect on the learning rates of apprentices (up to 80% of mistakes are tolerated). In contrast, just 10% of apprentice-generated visual mistakes in predator identification will prevent any vocal symbol to be correctly associated with a predator call in a stable manner. Tutor unreliability was also deleterious to vocal symbol learning: a mere 5% of “lying” tutors were able to completely disrupt symbol learning, invariably leading to the acquisition of incorrect associations by apprentices. Our investigation corroborates the existence of vocal symbols in a non-human species, and indicates that symbolic competence emerges spontaneously from classical associative learning mechanisms when the conditioned stimuli are self-generated, arbitrary and socially efficacious. We propose that more exclusive properties of human language, such as syntax, may derive from the evolution of higher-order domains for neural association, more removed from both the sensory input and the motor output, able to support the gradual complexification of grammatical categories into syntax. (shrink)

Floridi and Taddeo propose a condition of “zero semantic commitment” for solutions to the grounding problem, and a solution to it. I argue briefly that their condition cannot be fulfilled, not even by their own solution. After a look at Luc Steels' very different competing suggestion, I suggest that we need to re-think what the problem is and what role the ‘goals’ in a system play in formulating the problem. On the basis of a proper understanding of computing, I (...) come to the conclusion that the only sensible ground-ing problem is how we can explain and re-produce the behavioral ability and function of meaning in artificial computational agents. (shrink)

The emerging contemporary natural philosophy provides a common ground for the integrative view of the natural, the artificial, and the human-social knowledge and practices. Learning process is central for acquiring, maintaining, and managing knowledge, both theoretical and practical. This paper explores the relationships between the present advances in understanding of learning in the sciences of the artificial (deep learning, robotics), natural sciences (neuroscience, cognitive science, biology), and philosophy (philosophy of computing, philosophy of mind, natural philosophy). The question is, what (...) at this stage of the development the inspiration from nature, specifically its computational models such as info-computation through morphological computing, can contribute to machine learning and artificial intelligence, and how much on the other hand models and experiments in machine learning and robotics can motivate, justify, and inform research in computational cognitive science, neurosciences, and computing nature. We propose that one contribution can be understanding of the mechanisms of ‘learning to learn’, as a step towards deep learning with symbolic layer of computation/information processing in a framework linking connectionism with symbolism. As all natural systems possessing intelligence are cognitive systems, we describe the evolutionary arguments for the necessity of learning to learn for a system to reach human-level intelligence through evolution and development. The paper thus presents a contribution to the epistemology of the contemporary philosophy of nature. (shrink)

The emerging contemporary natural philosophy provides a common ground for the integrative view of the natural, the artificial, and the human-social knowledge and practices. Learning process is central for acquiring, maintaining, and managing knowledge, both theoretical and practical. This paper explores the relationships between the present advances in understanding of learning in the sciences of the artificial, natural sciences, and philosophy. The question is, what at this stage of the development the inspiration from nature, specifically its computational models such as (...) info-computation through morphological computing, can contribute to machine learning and artificial intelligence, and how much on the other hand models and experiments in machine learning and robotics can motivate, justify, and inform research in computational cognitive science, neurosciences, and computing nature. We propose that one contribution can be understanding of the mechanisms of ‘learning to learn’, as a step towards deep learning with symbolic layer of computation/information processing in a framework linking connectionism with symbolism. As all natural systems possessing intelligence are cognitive systems, we describe the evolutionary arguments for the necessity of learning to learn for a system to reach humanlevel intelligence through evolution and development. The paper thus presents a contribution to the epistemology of the contemporary philosophy of nature. (shrink)

This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are discussed, and (...) a prototype natural-language-understanding system is presented as an illustration. (shrink)

How the mind works is the ultimate mystery for human beings. To answer this question, one of the most significant insights is Kant’s argument that we can only perceive phenomena but not the essence of the external world. Following this idea, we formulated a novel computational framework to model the mind based on two assumptions: 1) There is no presupposition of the existence of the external objective world and the main task of the mind is to explore, establish and utilize (...) persistent relationships between senses and actions. 2) Symbolic intermediate-level representation is necessary. We call this framework the self-programming system. Based on the self-programming system, we interpreted the nature of concepts, time, space, causality, and consciousness. Besides that, we also draw a conclusion to the mind-body problem. Specifically, the perspective that considers subjective experience as fundamental is compatible with the existence of the external world and that the physical body serves as the substrate of the mind. However, since the relationship is “compatible” rather than “cause”, skepticism can never be ruled out in principle. Furthermore, we have elucidated the nature of interpretation within the context of reductive physicalism. This serves to provide a clear understanding as to why the hard problem of consciousness is inherently unsolvable. (shrink)

This paper proposes an extensionalist analysis of computer simulations (CSs). It puts the emphasis not on languages nor on models, but on symbols, on their extensions, and on their various ways of referring. It shows that chains of reference of symbols in CSs are multiple and of different kinds. As they are distinct and diverse, these chains enable different kinds of remoteness of reference and different kinds of validation for CSs. Although some methodological papers have already underlined the role of (...) these various relationships of reference in CSs and of cross-validations, this diversity is still overlooked in the epistemological literature on CSs. As a consequence, a particular outcome of this analytical view is an ability to classify existing epistemological theses on CSs according to what their authors choose to select and put at the forefront: either the extensions of symbols, or the symbol-types, or the symbol-tokens, or the internal denotational hierarchies of the CS or the reference of these hierarchies to external denotational hierarchies. Through the adoption of this extensionalist view, it also becomes possible to explain more precisely the reasons why some complete reduction of CSs to classical epistemic paradigms such as “experiment” or “theoretical argument” remains doubtful. On this last point, in particular, this paper is in agreement with what many epistemologists already have acknowledged. (shrink)

I will present the rationale followed for the conceptualization and the following development the Dual PECCS system that relies on the cognitively grounded heterogeneous proxytypes representational hypothesis [Lieto 2014]. Such hypothesis allows integrating exemplars and prototype theories of categorization as well as theory-theory [Lieto 2019] and has provided useful insights in the context of cognitive modelling for what concerns the typicality effects in categorization [Lieto, 2021]. As argued in [Lieto et al., 2018b] a pivotal role in this respect is played (...) by the use of the conceptual spaces framework and by its integration with a symbolic knowledge representation layer. (shrink)

The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So it is (...) with computing, which can be analog or digital, and is often mixed. The theory behind computers is essentially digital, but efficient simulations of phenomena can be performed by analog devices; indeed, any physical calculation requires implementation in the physical world and is therefore analog to some extent, despite being based on abstract logic and arithmetic. The mammalian brain, comprised of neuronal networks, functions as an analog device and has given rise to artificial neural networks that are implemented as digital algorithms but function as analog models would. Analog constructs compute with the implementation of a variety of feedback and feedforward loops. In contrast, digital algorithms allow the implementation of recursive processes that enable them to generate unparalleled emergent properties. We briefly illustrate how the cortical organization of neurons can integrate signals and make predictions analogically. While we conclude that brains are not digital computers, we speculate on the recent implementation of human writing in the brain as a possible digital path that slowly evolves the brain into a genuine (slow) Turing machine. (shrink)

The dialogue develops arguments for and against a broad new world system - info-computationalist naturalism - that is supposed to overcome the traditional mechanistic view. It would make the older mechanistic view into a special case of the new general info-computationalist framework (rather like Euclidian geometry remains valid inside a broader notion of geometry). We primarily discuss what the info-computational paradigm would mean, especially its pancomputationalist component. This includes the requirements for a the new generalized notion of computing that (...) would include sub-symbolic information processing. We investigate whether pancomputationalism can provide the basic causal structure to the world and whether the overall research program of info-computationalist naturalism appears productive, especially when it comes to new approaches to the living world, including computationalism in the philosophy of mind. (shrink)

Marr’s seminal distinction between computational, algorithmic, and implementational levels of analysis has inspired research in cognitive science for more than 30 years. According to a widely-used paradigm, the modelling of cognitive processes should mainly operate on the computational level and be targeted at the idealised competence, rather than the actual performance of cognisers in a specific domain. In this paper, we explore how this paradigm can be adopted and revised to understand mathematical problem solving. The computational-level approach applies methods from (...) computational complexity theory and focuses on optimal strategies for completing cognitive tasks. However, human cognitive capacities in mathematical problem solving are essentially characterised by processes that are computationally sub-optimal, because they initially add to the computational complexity of the solutions. Yet, these solutions can be optimal for human cognisers given the acquisition and enactment of mathematical practices. Here we present diagrams and the spatial manipulation of symbols as two examples of problem solving strategies that can be computationally sub-optimal but humanly optimal. These aspects need to be taken into account when analysing competence in mathematical problem solving. Empirically informed considerations on enculturation can help identify, explore, and model the cognitive processes involved in problem solving tasks. The enculturation account of mathematical problem solving strongly suggests that computational-level analyses need to be complemented by considerations on the algorithmic and implementational levels. The emerging research strategy can help develop algorithms that model what we call enculturated cognitive optimality in an empirically plausible and ecologically valid way. (shrink)

As physical entities that translate symbols into physical actions, computers offer insights into the nature of meaning and agency. • Physical symbol systems, generically known as agents, link abstractions to material actions. The meaning of a symbol is defined as the physical actions an agent takes when the symbol is encountered. • An agent has autonomy when it has the power to select actions based on internal decision processes. Autonomy offers a partial escape from constraints imposed by direct physical influences (...) such as gravity and the transfer of momentum. Swimming upstream is an example. • Symbols are names that can designate other entities. It appears difficult to explain the use of names and symbols in terms of more primitive functionality. The ability to use names and symbols, i.e., symbol grounding, may be a fundamental cognitive building block. • The standard understanding of causality—wiggling X results in Y wiggling—applies to both physical causes (e.g., one billiard ball hitting another) and symbolic causes (e.g., a traffic light changing color). Because symbols are abstract, they cannot produce direct physical effects. For a symbol to be a cause requires that the affected entity determine its own response. This is called autonomous causality. • This analysis of meaning and autonomy offers new perspectives on free will. (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)

This study examines problems related to the representation of music. It constructs the sender/message/perceiver/result model, a prototype broad enough to incorporate a large variety of music and other notation systems, including those having to do with computers. The work defines music notation itself, describes various models for studying the subject--including the binary types prescriptive/descriptive, and symbolic/iconic--and assesses music notation as a contemporary practice. It encompasses a review of the actions and intentions of composers, performers, and audiences, and a consideration (...) of the message and how it is affected by media , reference systems , and meanings. Finally, through an examination of the possibilities of the self acting as a notation system within models posited by feminist and queer theory, I attempt to demonstrate the power of notation to affect other systems and worlds, including the worlds of music, art, and politics. ;The consideration of these topics draws on theories from linguistics, semiotics, structuralism, post-structuralism, cybernetics, and music, as well as the philosophies of John Cage, Jean-Jacques Nattiez, Nelson Goodman, and others. The work examines various languages and applications used to program computers for musical purposes, though this examination does not incorporate programs dedicated exclusively to printing music. Nor does the study focus on non-Western notations, suggestions for reforms of notation, or encyclopedic lists of notation devices. ;The expository writing is augmented by excerpts from material I gathered in numerous interviews. There are separate sections containing interviews of Leonard Meyer, Allan Kaprow, John Cage, Earle Brown, Roger Reynolds, and Heidi von Gunden. There is also a large, partially-annotated bibliography. ;My hope is that an inclusive, interdisciplinary exploration of music notation will be useful in broadening the theoretical and creative boundaries of the field, as well as bridging gaps among musicians using various music technologies, and artists and theorists from diverse fields and perspectives. (shrink)

The paper is a commentary on the target article by Christine A. Skarda & Walter J. Freeman, “How brains make chaos in order to make sense of the world”, in the same issue of the journal, pp.161–195. -/- I confine my comments largely to some philosophical claims that Skarda & Freeman make and to the relationship of their model to connectionism. Some of the comments hinge on what symbols are and how they might sit in neural systems.

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)

In Philosophical Investigations 193–94, Wittgenstein draws a notorious analogy between the working of a machine and the application of a rule. According to the view of rule-following that Wittgenstein is criticizing, the future applications of a rule are completely determined by the rule itself, as the movements of the machine components are completely determined by the machine configuration. On what conception of the machine is such an analogy based? In this paper, I intend to show that Wittgenstein relied on quite (...) a specific scientific tradition very active at the beginning of the twentieth century: the kinematic or the general science of machines. To explain the fundamental tenets of this line of research and its links with Wittgenstein, I focus on Franz Reuleaux, whose works were known to Wittgenstein. The first payoff of this investigation is to help distance the functionalist framework from which this passage is often read: Wittgenstein’s machines are not computers. The second payoff is to explain why Wittgenstein talks about machines at this place in his discussion on rule-following: it is not the machine model in itself that is criticized in PI 193–94, but the “philosophical” temptation to generalize from it. (shrink)

The Language of Thought program has a suicidal edge. Jerry Fodor, of all people, has argued that although LOT will likely succeed in explaining modular processes, it will fail to explain the central system, a subsystem in the brain in which information from the different sense modalities is integrated, conscious deliberation occurs, and behavior is planned. A fundamental characteristic of the central system is that it is “informationally unencapsulated” -- its operations can draw from information from any cognitive domain. The (...) domain general nature of the central system is key to human reasoning; our ability to connect apparently unrelated concepts enables the creativity and flexibility of human thought, as does our ability to integrate material across sensory divides. The central system is the holy grail of cognitive science: understanding higher cognitive function is crucial to grasping how humans reach their highest intellectual achievements. But according to Fodor, the founding father of the LOT program and the related Computational Theory of Mind (CTM), the holy grail is out of reach: the central system is likely to be non-computational (Fodor 1983, 2000, 2008). Cognitive scientists working on higher cognitive function should abandon their efforts. Research should be limited to the modules, which for Fodor rest at the sensory periphery (2000).1 Cognitive scientists who work in the symbol processing tradition outside of philosophy would reject this pessimism, but ironically, within philosophy itself, this pessimistic streak has been very influential, most likely because it comes from the most well-known proponent of LOT and CTM. Indeed, pessimism about centrality has become assimilated into the mainstream conception of LOT. (Herein, I refer to a LOT that appeals to pessimism about centrality as the “standard LOT”). I imagine this makes the standard LOT unattractive to those philosophers with a more optimistic approach to what cognitive science can achieve.. (shrink)

In philosophy of language, a distinction has been proposed between two aspects of lexical competence, i.e. referential and inferential competence (Marconi 1997). The former accounts for the relationship of words to the world, the latter for the relationship of words among themselves. The distinction may simply be a classification of patterns of behaviour involved in ordinary use of the lexicon. Recent research in neuropsychology and neuroscience, however, suggests that the distinction might be neurally implemented, i.e., that different cognitive architectures with (...) partly distinct neural realizations might be responsible for cognitive performances involving inferential and referential aspects of semantics. This hypothesis is strongly consistent with patient data supporting the notion of a functional double dissociation between inferential and referential abilities, and with a set of direct cortical mapping studies and neuroimaging experiments suggesting that inferential and referential abilities are underpinned by at least partly different regions of the human brain (e.g., Marconi et al. 2013; review in Calzavarini 2017). The initial hypotheses formulated in the setting of the philosophy of language, along with the neuropsychological experimental evidence (about how referential and inferential competences may be neurally instantiated) can be the input to computational modelling activities involving the inferential and the referential aspects of lexical competence. The aim of the talk is to offer a critical discussion of the kind of formalisms that can be used to model the two aspects of lexical competence, and of the main difficulties related to the use of these computational techniques. -/- Inferential (=symbolic) vs referential (=connectionist) formalisms. (shrink)

Linguistic expressions must be decrypted if they are to transmit information. Thoughts need not be decrypted if they are to transmit information. Therefore thought-processes do not consist of linguistic expressions: thought is not linguistic. A consequence is that thought is not computational, given that a computation is the operationalization of a function that assigns one expression to some other expression (or sequence of expressions).

This essay examines the possibility that phenomenological laws might be implemented by a computational mechanism by carefully analyzing key passages from the Prolegomena to Pure Logic. Part I examines the famous Denkmaschine passage as evidence for the view that intuitions of evidence are causally produced by computational means. Part II connects the less famous criticism of Avenarius & Mach on thought-economy with Husserl's 1891 essay 'On the Logic of Signs (Semiotic).' Husserl is shown to reaffirm his earlier opposition to associationist (...) (Humean) and adaptationist (Darwinian) explanations of our thought-machine on the ground that they cannot reconstruct the notion of truth and its syntactic mental preservation in symbolic thought-trains. Part III reveals Husserl's interesting commitment to the idea that descriptive sciences necessarily transform into explanatory sciences on pain of contradicting the essence of science as a rational ideal. Since explanation in relation to phenomenology means causal explanation, and causal explanation in the form of the Denkmaschine accounts for phenomenological intuition, it is inferred that the rationally compelling ideal of explanatory science requires a computationalist reading of the subsequent logical investigations. (shrink)

There exists a huge number of numerical methods that iteratively construct approximations to the solution y(x) of an ordinary differential equation (ODE) y′(x) = f(x,y) starting from an initial value y_0=y(x_0) and using a finite approximation step h that influences the accuracy of the obtained approximation. In this paper, a new framework for solving ODEs is presented for a new kind of a computer – the Infinity Computer (it has been patented and its working prototype exists). The new computer is (...) able to work numerically with finite, infinite, and infinitesimal numbers giving so the possibility to use different infinitesimals numerically and, in particular, to take advantage of infinitesimal values of h. To show the potential of the new framework a number of results is established. It is proved that the Infinity Computer is able to calculate derivatives of the solution y(x) and to reconstruct its Taylor expansion of a desired order numerically without finding the respective derivatives analytically (or symbolically) by the successive derivation of the ODE as it is usually done when the Taylor method is applied. Methods using approximations of derivatives obtained thanks to infinitesimals are discussed and a technique for an automatic control of rounding errors is introduced. Numerical examples are given. (shrink)

As part of the development of the Symbolic and Sub-symbolic Robotics Intelligence Control System, we have implemented a memory store to allow a robot to retain knowledge from previous exp...

As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...) many twists and turns as a thriller. At the end of the story is a new principle for designing programming languages that will guide computers into the 21st century. -/- For my money, Gentzen’s natural deduction and Church’s lambda calculus are on a par with Einstein’s relativity and Dirac’s quantum physics for elegance and insight. And the maths are a lot simpler. I want to show you the essence of these ideas. I’ll need a few symbols, but not too many, and I’ll explain as I go along. -/- To simplify, I’ll present the story as we understand it now, with some asides to fill in the history. First, I’ll introduce Gentzen’s natural deduction, a formalism for proofs. Next, I’ll introduce Church’s lambda calculus, a formalism for programs. Then I’ll explain why proofs and programs are really the same thing, and how simplifying a proof corresponds to executing a program. Finally, I’ll conclude with a look at how these principles are being applied to design a new generation of programming languages, particularly mobile code for the Internet. (shrink)

John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: Everything (...) makes sense. The question is: What sense does it make?" This essay explores what sense it makes to say that syntax by itself is sufficient for semantics. (shrink)

A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework. The (...) new methodology has allowed us to introduce the Infinity Computer working with such numbers (its simulator has already been realized). Examples dealing with divergent series, infinite sets, and limits are given. (shrink)

his article will focus on the mechanistic origins of the computer metaphor, which forms the conceptual framework for the methodology of the cognitive sciences, some areas of artificial intelligence and the philosophy of mind. The connection between the history of computing technology, epistemology and the philosophy of mind is expressed through the metaphorical dictionaries of the philosophical discourse of a particular era. The conceptual clarification of this connection and the substantiation of the mechanistic components of the computer metaphor is (...) the main goal of this article. The statement is substantiated that the invention of mechanical computing devices, having a long history in the European engineering tradition, formed the prerequisites for the emergence of machine functionalism in the modern philosophy of mind. The idea of multiple implementation stems from the principle that a formal symbol system prescribes rules for the use of rational abstractions through the physical architecture of a computational engine. The article considers the reasons for the conceptual shift and reveals the semantic foundations for the metaphorical transfer of the properties of abstract objects from the theory of automata to the field of modern philosophy of mind. The criticism and ways of protecting the philosophical program of machine functionalism are analyzed by changing the content of the metaphor “Mind as machine”. The reasons for the stability of the information-computer approach in cognitive sciences are also disclosed and explained. (shrink)

The Turing Test (TT), the Chinese Room Argument (CRA), and the Symbol Grounding Problem (SGP) are about the question “can machines think?” We propose to look at these approaches to Artificial Intelligence (AI) by showing that they all address the possibility for Artificial Agents (AAs) to generate meaningful information (meanings) as we humans do. The initial question about thinking machines is then reformulated into “can AAs generate meanings like humans do?” We correspondingly present the TT, the CRA and the SGP (...) as being about generation of human-like meanings. We model and address such possibility by using the Meaning Generator System (MGS) where a system submitted to an internal constraint generates a meaning in order to satisfy the constraint. The system approach of the MGS allows comparing meaning generations in animals, humans and AAs. The comparison shows that in order to have AAs capable of generating human-like meanings, we need the AAs to carry human constraints. And transferring human constraints to AAs raises concerns coming from the unknown natures of life and human mind which are at the root of human constraints. Implications for the TT, the CRA and the SGP are highlighted. It is shown that designing AAs capable of thinking like humans needs an understanding about the natures of life and human mind that we do not have today. Following an evolutionary approach, we propose as a first entry point an investigation about the possibility for extending a “stay alive” constraint into AAs. Ethical concerns are raised from the relations between human constraints and human values. Continuations are proposed. (This paper is an extended version of the proceedings of an AISB/IACAP 2012 presentation). (shrink)

The evolution from pre-human primates to modern Homo sapiens is a complex one involving many domains, ranging from the material to the social to the cognitive, both at the individual and the community levels. This article focuses on a critical qualitative transition that took place during this evolution involving both the social and the cognitive domains. For the social domain, the transition is from the face-to-face forms of social interaction and organization that characterize the non-human primates that reached, with Pan, (...) a hiatus due to the centripetal effects that highly individualized behavior has on a social system. The transition is to the relation-based forms of social organization that evolved in the hominins ancestral to Homo sapiens and are universal in human societies today. For the cognitive domain, this transition involves going from behavior responding mainly to phenomenal level sensory inputs to behavior formed in accordance with the concept of a relation, initially abstracted from behavior patterns, then extending the concept of a relation beyond abstraction from behavior patterns to the concept of a relation generated recursively through constructing the relation of a relation. This extension made possible the construction of systems of relations; initially genealogical systems of relations constructed culturally using the logic of recursion, and subsequently, the symbolic, computational systems of kin term relations referred to by anthropologists as kinship terminologies. The latter are “constructed realities” in the sense this term is used by cultural anthropologists. It follows that the evolution of relation-based systems of social interaction is not adequately accounted for through population model evolutionary accounts such as the Dual Inheritance Theory of human evolution since “constructed realities” constitute collectively and publicly shared cultural knowledge rather than the individually and privately possessed knowledge that is assumed in the population model framework for human evolution. (shrink)

Yoshimi has attempted to defuse my argument concerning the identification of network abstraction with empiricist abstraction - thus entailing psychologism - by claiming that the argument does not generalize from the example of simple feed-forward networks. I show that the particular details of networks are logically irrelevant to the nature of the abstractive process they employ. This is ultimately because deep artificial neural networks (ANNs) and dynamical systems theory applied to the mind (DST) are both associationisms - that is, empiricist (...) theories that derive the principles of thought from the causal history of the organism/system. On this basis, I put forward a new aspect of the old argument by noting that ANNs & DST are the causal bases of the phenomena of passive synthesis, whereas the language of thought hypothesis (LOT) and the symbolic computational theory of mind (CTM) are the causal bases of the phenomena of active synthesis. If the phenomena of active synthesis are not distinct in kind from and are thus reducible to those of passive synthesis, psychologism results. Yoshimi’s program, insofar as it denies this fundamental phenomenological distinction, is revealed to be the true anti-pluralist program, by essentially denying the causal efficacy of the mechanistic foundations of active synthesis by referring phenomenology exclusively to associationism for its causal foundation. (shrink)

Modern computing is generally taken to consist primarily of symbol manipulation. But symbols are abstract, and computers are physical. How can a physical device manipulate abstract symbols? Neither Church nor Turing considered this question. My answer is that the bit, as a hardware-implemented abstract data type, serves as a bridge between materiality and abstraction. Computing also relies on three other primitive—but more straightforward—abstractions: Sequentiality, State, and Transition. These physically-implemented abstractions define the borderline between hardware and software and between (...) physicality and abstraction. At a deeper level, asking how a physical device can interact with abstract symbols is the wrong question. The relationship between symbols and physical devices begins with the realization that human beings already know what it means to manipulate symbols. We build and program computers to do what we understand to be symbol manipulation. To understand what that means, consider a light switch. A light switch doesn’t turn a light on or off. Those are abstractions. Light switches don’t operate with abstractions. We build light switches, so that when flipped, the world is changed in such a way that we understand the light to be on or off. Similarly, we build computers to perform operations that we understand as manipulating symbols. (shrink)

I see four symbol grounding problems: 1) How can a purely computational mind acquire meaningful symbols? 2) How can we get a computational robot to show the right linguistic behavior? These two are misleading. I suggest an 'easy' and a 'hard' problem: 3) How can we explain and re-produce the behavioral ability and function of meaning in artificial computational agents?4) How does physics give rise to meaning?

It is here proposed an analysis of symbolic and sub-symbolic models for studying cognitive processes, centered on emergence and logical openness notions. The Theory of logical openness connects the Physics of system/environment relationships to the system informational structure. In this theory, cognitive models can be ordered according to a hierarchy of complexity depending on their logical openness degree, and their descriptive limits are correlated to Gödel-Turing Theorems on formal systems. The symbolic models with low logical openness describe (...) cognition by means of semantics which fix the system/environment relationship, while the sub-symbolic ones with high logical openness tends to seize its evolutive dynamics. An observer is defined as a system with high logical openness. In conclusion, the characteristic processes of intrinsic emergence typical of “bio-logic” - emerging of new codes-require an alternative model to Turing- computation, the natural or bio-morphic computation, whose essential features we are going here to outline. (shrink)

This paper presents a view of nature as a network of infocomputational agents organized in a dynamical hierarchy of levels. It provides a framework for unification of currently disparate understandings of natural, formal, technical, behavioral and social phenomena based on information as a structure, differences in one system that cause the differences in another system, and computation as its dynamics, i.e. physical process of morphological change in the informational structure. We address some of the frequent misunderstandings regarding the natural/morphological computational (...) models and their relationships to physical systems, especially cognitive systems such as living beings. Natural morphological infocomputation as a conceptual framework necessitates generalization of models of computation beyond the traditional Turing machine model presenting symbol manipulation, and requires agent-based concurrent resource-sensitive models of computation in order to be able to cover the whole range of phenomena from physics to cognition. The central role of agency, particularly material vs. cognitive agency is highlighted. (shrink)

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine learning results (...) in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS computational knowledge-representation system, (...) the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

Good old-fashioned cognitive science characterizes human thinking as symbol manipulation qua computation and therefore emphasizes the processing of symbolic representations as a necessary if not sufficient condition for “general intelligent action.” Recent alternative conceptions of human thinking tend to deemphasize if not altogether eschew the notion of representation. The present paper shows how classical American pragmatist conceptions of human thinking can successfully avoid either of these extremes, replacing old-fashioned conceptions of representation with one that characterizes both representatum and representans (...) in externalist terms. (shrink)

The standard view of classical cognitive science stated that cognition consists in the manipulation of language-like structures according to formal rules. Since cognition is ‘linguistic’ in itself, according to this view language is just a complex communication system and does not influence cognitive processes in any substantial way. This view has been criticized from several perspectives and a new framework (Embodied Cognition) has emerged that considers cognitive processes as non-symbolic and heavily dependent on the dynamical interactions between the cognitive (...) system and its environment. But notwithstanding the successes of the embodied cognitive science in explaining low-level cognitive behaviors, it is still not clear whether and how it can scale up for explaining high-level cognition. In this paper we argue that this can be done by considering the role of language as a cognitive tool: i.e. how language transforms basic cognitive functions in the high-level functions that are characteristic of human cognition. In order to do that, we review some computational models that substantiate this view with respect to categorization and memory. Since these models are based on a very rudimentary form of non-syntactic ‘language’ we argue that the use of language as a cognitive tool might have been an early discovery in hominid evolution, and might have played a substantial role in the evolution of language itself. (shrink)

A series of representations must be semantics-driven if the members of that series are to combine into a single thought: where semantics is not operative, there is at most a series of disjoint representations that add up to nothing true or false, and therefore do not constitute a thought at all. A consequence is that there is necessarily a gulf between simulating thought, on the one hand, and actually thinking, on the other. A related point is that a popular doctrine (...) - the so-called 'computational theory of mind' (CTM) - is based on a confusion. CTM is the view that thought-processes consist in 'computations', where a computation is defined as a 'form-driven' operation on symbols. The expression 'form-driven operation' is ambiguous, as it may refer either to syntax-driven operations or to morphology-driven operations. Syntax-driven operations presuppose the existence of operations that are driven by semantic and extra-semantic knowledge. So CTM is false if the terms 'computation' and 'form-driven operation' are taken to refer to syntax-driven operations. Thus, if CTM is to work, those expressions must be taken to refer to morphology-driven operations. CTM therefore fails, given that an operation must be semantics-driven if it is to qualify as a thought. CTM therefore fails on each possible disambiguation of the expressions 'formal operation' and 'computation,' and it is therefore false. (shrink)

Why would we want to develop artificial human-like arithmetical intelligence, when computers already outperform humans in arithmetical calculations? Aside from arithmetic consisting of much more than mere calculations, one suggested reason is that AI research can help us explain the development of human arithmetical cognition. Here I argue that this question needs to be studied already in the context of basic, non-symbolic, numerical cognition. Analyzing recent machine learning research on artificial neural networks, I show how AI studies could potentially (...) shed light on the development of human numerical abilities, from the proto-arithmetical abilities of subitizing and estimating to counting procedures. Although the current results are far from conclusive and much more work is needed, I argue that AI research should be included in the interdisciplinary toolbox when we try to explain the development and character of numerical cognition and arithmetical intelligence. This makes it relevant also for the epistemology of mathematics. (shrink)

A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional methodologies (...) studying infinities and infinitesimals only symbolically. The grossone methodology uses the Euclid’s Common Notion no. 5 ‘The whole is greater than the part’ and applies it to finite, infinite, and infinitesimal quantities and to finite and infinite sets and processes. It does not contradict Cantor’s and non-standard analysis views on infinity and can be considered as an applied development of their ideas. In this paper we consider infinite series and a particular attention is dedicated to divergent series with alternate signs. The Riemann series theorem states that conditionally convergent series can be rearranged in such a way that they either diverge or converge to an arbitrary real number. It is shown here that Riemann’s result is a consequence of the fact that symbol ∞ used traditionally does not allow us to express quantitatively the number of addends in the series, in other words, it just shows that the number of summands is infinite and does not allows us to count them. The usage of the grossone methodology allows us to see that (as it happens in the case where the number of addends is finite) rearrangements do not change the result for any sum with a fixed infinite number of summands. There are considered some traditional summation techniques such as Ramanujan summation producing results where to divergent series containing infinitely many positive integers negative results are assigned. It is shown that the careful counting of the number of addends in infinite series allows us to avoid this kind of results if grossone-based numerals are used. (shrink)

The prologue of the Sophistici elenchi is as close an Aristotelian text gets to dealing with language as a subject matter in its own right, only in reverse. Language and its features bear consideration to the extent that they account for some major predicaments discursive reasoning is prone to, both as a separate and as a common endeavour. That being said, the linguistic pitfalls that trick us into thinking that whatever is the case for words and word-compounds is also the (...) case for the things and facts linguistic items stand for reveal as much about good linguistic habits and sound argumentation as they themselves are revealed by the principles and rules our argumentation goes by. In this connection, Aristotle resorted to a curious (or not so curious) analogy between words and counters which played a major role in explaining why language is such a powerful source of illusion and deception. As it happens, Aristotle accounting analogy is a case in point for showcasing the level of sophistication medieval Latin literature on fallacies achieved as early as the first half of the twelfth century. As a matter of fact, Western commentators managed to build compelling cases both in favour of and against the understanding that was to become and still is the standard story – which, of course, speaks volumes about their exegetical proficiency and technical expertise. On the one hand, trusting implicitly Boethius’ translation and well aware of his views on disputational hazards as opposed to computational reliability, they usually understood Aristotle’s comparison as if it was an analogy in name only. On the other hand, despite Boethius’ translation put them at a considerable disadvantage, Latin commentators were able to construe Aristotle’s analogy as bringing together two sets of symbolic variables (words and counters) that are neither entirely free nor entirely bound – which expose them to subtle but critical shifts in value and meaning. (shrink)

This paper takes up the challenge which Carnap poses in his Aufbau: to make of it a basis for continued epistemological research. I try to close some gaps in Carnap’s original presentation and to make at least the first few steps of his constructional outline more accessible to the modern reader. Particularly emphasized is Carnap’s implicit recognition that, to be effective, “structural” models of epistemology (using logical symbols) must be complemented with “procedural” models (his “fictitious operations”). The paper shows how (...) a procedural model, a computer program,can “bypass” Nelson Goodman’s counter example to Carnap’s logical construction of “similarity circles”. (shrink)