With 500+ papers and 20+ books spanning many scientific disciplines, Mark Burgin has left an indelible mark and legacy for future explorers of human thought and information technology professionals. In this paper, I discuss his contribution to the evolution of machine intelligence using his general theory of information (GTI) based on my discussions with him and various papers I co-authored during the past eight years. His construction of a new class of digital automata to overcome the barrier posed by the (...) Church–Turing Thesis, and his contribution to super-symbolic computing with knowledge structures, cognizing oracles, and structural machines are leading to practical applications changing the future landscape of information systems. GTI provides a model for the operational knowledge of biological systems to build, operate, and manage life processes using 30+ trillion cells capable of replication and metabolism. The schema and associated operations derived from GTI are also used to model a digital genome specifying the operational knowledge of algorithms executing the software life processes with specific purposes using replication and metabolism. The result is a digital software system with a super-symbolic computing structure exhibiting autopoietic and cognitive behaviors that biological systems also exhibit. We discuss here one of these applications. (shrink)

We live in an information society where the usage, creation, distribution, manipulation, and integration of information is a significant activity. Computations allow us to process information from various sources in various forms and use the derived knowledge in improving efficiency and resilience in our interactions with each other and with our environment. The general theory of information tells us that information to knowledge is as energy is to matter. Energy has the potential to create or modify material structures and information (...) has the potential to create or modify knowledge structures. In this paper, we analyze computations as a vital technological phenomenon of contemporary society which allows us to process and use information. This analysis allows building classifications of computations based on their characteristics and explication of new types of computations. As a result, we extend the existing typologies of computations by delineating novel forms of information representations. While the traditional approach deals only with two dimensions of computation—symbolic and sub-symbolic, here we describe additional dimensions, namely, super-symbolic computation, hybrid computation, fused computation, blended computation, and symbiotic computation. (shrink)

The tape is divided into squares, each square bearing a single symbol—'0' or '1', for example. This tape is the machine's general-purpose storage medium: the machine is set in motion with its input inscribed on the tape, output is written onto the tape by the head, and the tape serves as a short-term working memory for the results of intermediate steps of the computation. The program governing the particular computation that the machine is to perform is also stored on the (...) tape. A small, fixed program that is 'hard-wired' into the head enables the head to read and execute the instructions of whatever program is on the tape. The machine's atomic operations are very simple—for example, 'move left one square', 'move right one square', 'identify the symbol currently beneath the head', 'write 1 on the square that is beneath the head', and 'write 0 on the square that is beneath the head'. Complexity of operation is achieved by the chaining together of large numbers of these simple atoms. Any universal Turing machine can be programmed to carry out any calculation that can be performed by a human mathematician working with paper and pencil in accordance with some algorithmic method. This is what is meant by calling these machines 'universal'. (shrink)

``Neural computing'' is a research field based on perceiving the human brain as an information system. This system reads its input continuously via the different senses, encodes data into various biophysical variables such as membrane potentials or neural firing rates, stores information using different kinds of memories (e.g., short-term memory, long-term memory, associative memory), performs some operations called ``computation'', and outputs onto various channels, including motor control commands, decisions, thoughts, and feelings. We show a natural model of neural (...) class='Hi'>computing that gives rise to hyper-computation. Rigorous mathematical analysis is applied, explicating our model's exact computational power and how it changes with the change of parameters. Our analog neural network allows for supra-Turing power while keeping track of computational constraints, and thus embeds a possible answer to the superiority of the biological intelligence within the framework of classical computer science. We further propose it as standard in the field of analog computation, functioning in a role similar to that of the universal Turing machine in digital computation. In particular an analog of the Church-Turing thesis of digital computation is stated where the neural network takes place of the Turing machine. (shrink)

This book offers a sustained critique of the computational theory of mind that deserves the attention of those interested in the presuppositions and implications of computational psychology. Horst begins by laying out the theory, reconstructing its perceived role in vindicating intentional psychology, and recounting earlier critiques on which he builds. Part 2, the heart of the book, analyzes a notion central to CTM—that of a symbol—arguing that symbols are conventional. In Part 3 Horst applies the results of this analysis to (...) CTM to diagnose a serious confusion in its account of semantic properties and the corresponding notion of mental representation. Part 4 offers an alternative perspective on computational psychology, suggesting a separation of the practice of computational psychology from the philosophical claims made by CTM. (shrink)

In this carefully argued critique, Steven Horst pronounces the theory deficient.

This paper proposes how various disciplinary theories of cognition may be combined into a unifying, sub-symbolic, computational theory of cognition. The following theories are considered for integration: psychological theories, including the theory of event coding, event segmentation theory, the theory of anticipatory behavioral control, and concept development; artificial intelligence and machine learning theories, including reinforcement learning and generative artificial neural networks; and theories from theoretical and computational neuroscience, including predictive coding and free energy-based inference. In the light of such (...) a potential unification, it is discussed how abstract cognitive, conceptualized knowledge and understanding may be learned from actively gathered sensorimotor experiences. The unification rests on the free energy-based inference principle, which essentially implies that the brain builds a predictive, generative model of its environment. Neural activity-oriented inference causes the continuous adaptation of the currently active predictive encodings. Neural structure-oriented inference causes the longer term adaptation of the developing generative model as a whole. Finally, active inference strives for maintaining internal homeostasis, causing goal-directed motor behavior. To learn abstract, hierarchical encodings, however, it is proposed that free energy-based inference needs to be enhanced with structural priors, which bias cognitive development towards the formation of particular, behaviorally suitable encoding structures. As a result, it is hypothesized how abstract concepts can develop from, and thus how they are structured by and grounded in, sensorimotor experiences. Moreover, it is sketched-out how symbol-like thought can be generated by a temporarily active set of predictive encodings, which constitute a distributed neural attractor in the form of an interactive free-energy minimum. The activated, interactive network attractor essentially characterizes the semantics of a concept or a concept composition, such as an actual or imagined situation in our environment. Temporal successions of attractors then encode unfolding semantics, which may be generated by a behavioral or mental interaction with an actual or imagined situation in our environment. Implications, further predictions, possible verification and falsifications, as well as potential enhancements into a fully spelled-out unified theory of cognition are discussed at the end of the paper. (shrink)

One cannot summarize the intent of this insightful and engaging book better than the author himself: “The thesis... is that CTM [the Computational Theory of Mind] does not provide a solution to the philosophical problems that it is heralded as solving—indeed, it involves some deep confusions about computers, symbols, and meaning—but that this does not undercut the possibility that the computer paradigm may provide an important resource... for the development of a mature science of cognition”.

When asked about humanity’s future relationship with computers, Marvin Minsky famously replied “If we’re lucky, they might decide to keep us as pets”. A number of eminent authorities continue to argue that there is a real danger that “super-intelligent” machines will enslave—perhaps even destroy—humanity. One might think that it would swiftly follow that we should abandon the pursuit of AI. Instead, most of those who purport to be concerned about the existential threat posed by AI default to worrying about (...) what they call the “Friendly AI problem”. Roughly speaking this is the question of how we might ensure that the AI that will develop from the first AI that we create will remain sympathetic to humanity and continue to serve, or at least take account of, our interests. In this paper I draw on the “neo-republican” philosophy of Philip Pettit to argue that solving the Friendly AI problem would not change the fact that the advent of super-intelligent AI would be disastrous for humanity by virtue of rendering us the slaves of machines. A key insight of the republican tradition is that freedom requires equality of a certain sort, which is clearly lacking between pets and their owners. Benevolence is not enough. As long as AI has the power to interfere in humanity’s choices, and the capacity to do so without reference to our interests, then it will dominate us and thereby render us unfree. The pets of kind owners are still pets, which is not a status which humanity should embrace. If we really think that there is a risk that research on AI will lead to the emergence of a superintelligence, then we need to think again about the wisdom of researching AI at all. (shrink)

This book constitutes the thoroughly refereed post-proceedings of the International Conference on Artificial Intelligence and Symbolic Computation, AISC 2000, held in Madrid, Spain in July 2000. The 17 revised full papers presented together with three invited papers were carefully reviewed and revised for inclusion in the book. Among the topics addressed are automated theorem proving, logical reasoning, mathematical modeling of multi-agent systems, expert systems and machine learning, computational mathematics, engineering, and industrial applications.

In line with Allen Newell's challenge to develop complete cognitive architectures, and motivated by a recent proposal for a unifying subsymbolic computational theory of cognition, we introduce the cognitive control architecture SEMLINCS. SEMLINCS models the development of an embodied cognitive agent that learns discrete production rule-like structures from its own, autonomously gathered, continuous sensorimotor experiences. Moreover, the agent uses the developing knowledge to plan and control environmental interactions in a versatile, goal-directed, and self-motivated manner. Thus, in contrast to several well-known (...) symbolic cognitive architectures, SEMLINCS is not provided with production rules and the involved symbols, but it learns them. In this paper, the actual implementation of SEMLINCS causes learning and self-motivated, autonomous behavioral control of the game figure Mario in a clone of the computer game Super Mario Bros. Our evaluations highlight the successful development of behavioral versatility as well as the learning of suitable production rules and the involved symbols from sensorimotor experiences. Moreover, knowledge- and motivation-dependent individualizations of the agents’ behavioral tendencies are shown. Finally, interaction sequences can be planned on the sensorimotor-grounded production rule level. Current limitations directly point toward the need for several further enhancements, which may be integrated into SEMLINCS in the near future. Overall, SEMLINCS may be viewed as an architecture that allows the functional and computational modeling of embodied cognitive development, whereby the current main focus lies on the development of production rules from sensorimotor experiences. (shrink)

We aim to construct exact and explicit solutions to a generalized Bogoyavlensky-Konopelchenko equation through the Maple computer algebra system. The considered nonlinear equation is transformed into a Hirota bilinear form, and symbolic computations are made for solving both the nonlinear equation and the corresponding bilinear equation. A few classes of exact and explicit solutions are generated from different ansätze on solution forms, including traveling wave solutions, two-wave solutions, and polynomial solutions.

This book constitutes the refereed proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2004, held in Linz, Austria in September 2004. The 17 revised full papers and 4 revised short papers presented together with 4 invited papers were carefully reviewed and selected for inclusion in the book. The papers are devoted to all current aspects in the area of symbolic computing and AI: mathematical foundations, implementations, and applications in industry and academia.

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)

Computation is interpretable symbol manipulation. Symbols are objects that are manipulated on the basis of rules operating only on theirshapes, which are arbitrary in relation to what they can be interpreted as meaning. Even if one accepts the Church/Turing Thesis that computation is unique, universal and very near omnipotent, not everything is a computer, because not everything can be given a systematic interpretation; and certainly everything can''t be givenevery systematic interpretation. But even after computers and computation have been successfully distinguished (...) from other kinds of things, mental states will not just be the implementations of the right symbol systems, because of the symbol grounding problem: The interpretation of a symbol system is not intrinsic to the system; it is projected onto it by the interpreter. This is not true of our thoughts. We must accordingly be more than just computers. My guess is that the meanings of our symbols are grounded in the substrate of our robotic capacity to interact with that real world of objects, events and states of affairs that our symbols are systematically interpretable as being about. (shrink)

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty ; and to provide evidence that logic-based methods can well support reasoning with uncertainty. For the latter claim, two paradigmatic examples are presented: logic programming with Kleene semantics for modelling reasoning from information in a discourse, to an interpretation of the state of affairs of the intended model, and a neural-symbolic implementation of input/output logic for dealing with uncertainty in (...) dynamic normative contexts. (shrink)

A wide range of systems appear to perform computation: what common features do they share? I consider three examples, a digital computer, a neural network and an analogue route finding system based on soap-bubbles. The common feature of these systems is that they have autonomous dynamics — their states will change over time without additional external influence. We can take advantage of these dynamics if we understand them well enough to map a problem we want to solve onto them. Programming (...) consists of arranging the starting state of a system so that the effects of the system''s dynamics on some of its variables corresponds to the effects of the equations which describe the problem to be solved on their variables. The measured dynamics of a system, and hence the computation it may be performing, depend on the variables of the system we choose to attend to. Although we cannot determine which are the appropriate variables to measure in a system whose computation basis is unknown to us I go on to discuss how grammatical classifications of computational tasks and symbolic machine reconstruction techniques may allow us to rule out some measurements of a system from contributing to computation of particular tasks. Finally I suggest that these arguments and techniques imply that symbolic descriptions of the computation underlying cognition should be stochastic and that symbols in these descriptions may not be atomic but may have contents in alternative descriptions. (shrink)

We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π01 class P is a subshift if and only if there exists a computable function F mapping 2ℕ to 2ℕ such that P is the set of itineraries of elements of 2ℕ. Π01 subshifts are constructed in 2ℕ and in 2ℤ which have no computable elements. We also consider the symbolic dynamics of maps on the unit interval.

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 chapter focuses on one historically important approach to computationalism about thought. According to "the classical computational theory of mind" (CTM), thinking involves the algorithmic manipulation of mental symbols. The chapter reviews CTM and the related language of thought (LOT) position, urging that the orthodox position, associated with the groundbreaking work of Jerry Fodor, has failed to specify a key component: the notion of a mental symbol. It clarifies the notion of a LOT symbol and explores an approach different from (...) the orthodox, Fodorian LOT/CTM. The LOT position is a leading approach to the computational nature of thought. A key feature of LOT is that its mental representations have a combinatorial syntax. A representational system has a combinatorial syntax when it employs a finite store of atomic representations, which can be combined to form compound representations, which can then be combined to form further compound representations. (shrink)

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty ; and to provide evidence that logic-based methods can well support reasoning with uncertainty. For the latter claim, two paradigmatic examples are presented: logic programming with Kleene semantics for modelling reasoning from information in a discourse, to an interpretation of the state of affairs of the intended model, and a neural-symbolic implementation of input/output logic for dealing with uncertainty in (...) dynamic normative contexts. (shrink)

Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed (...) and interested nonspecialist. (shrink)

Over the past several decades, the philosophical community has witnessed the emergence of an important new paradigm for understanding the mind.1 The paradigm is that of machine computation, and its influence has been felt not only in philosophy, but also in all of the empirical disciplines devoted to the study of cognition. Of the several strategies for applying the resources provided by computer and cognitive science to the philosophy of mind, the one that has gained the most attention from philosophers (...) has been the Computational Theory of Mind (CTM). CTM was first articulated by Hilary Putnam (1960, 1961), but finds perhaps its most consistent and enduring advocate in Jerry Fodor (1975, 1980, 1981, 1987, 1990, 1994). It is this theory, and not any broader interpretations of what it would be for the mind to be a computer, that I wish to address in this paper. What I shall argue here is that the notion of symbolic representation employed by CTM is fundamentally unsuited to providing an explanation of the intentionality of mental states (a major goal of CTM), and that this result undercuts a second major goal of CTM, sometimes refered to as the vindication of intentional psychology. This line of argument is related to the discussions of derived intentionality by Searle (1980, 1983, 1984) and Sayre (1986, 1987). But whereas those discussions seem to be concerned with the causal dependence of familiar sorts of symbolic representation upon meaning-bestowing acts, my claim is rather that there is not one but several notions of meaning to be had, and that the notions that are applicable to symbols are conceptually dependent upon the notion that is applicable to mental states in the fashion that Aristotle refered to as paronymy. That is, an analysis of the notions of meaning applicable to symbols reveals that they contain presuppositions about meaningful mental states, much as Aristotle's analysis of the sense of healthy that is applied to foods reveals that it means conducive to having a healthy body, and hence any attempt to explain mental semantics in terms of the semantics of symbols is doomed to circularity and regress. I shall argue, however, that this does not have the consequence that computationalism is bankrupt as a paradigm for cognitive science, as it is possible to reconstruct CTM in a fashion that avoids these difficulties and makes it a viable research framework for psychology, albeit at the cost of losing its claims to explain intentionality and to vindicate intentional psychology. I have argued elsewhere (Horst, 1996) that local special sciences such as psychology do not require vindication in the form of demonstrating their reducibility to more fundamental theories, and hence failure to make good on these philosophical promises need not compromise the broad range of work in empirical cognitive science motivated by the computer paradigm in ways that do not depend on these problematic treatments of symbols. (shrink)

Cognitive scientists use computational models to represent the results of their experimental work and to guide further research. Neither of these claims is particularly controversial, but the philosophical and evidentiary statuses of these models are hotly debated. To clarify the issues, I return to Newell and Simon’s 1972 exposition on the computational approach; they herald its ability to describe mental operations despite that the neuroscience of the time could not. Using work on visual imagery (cf. imagination) as a guide, I (...) examine the extent to which this holds true today. Does contemporary neuroscience contain mechanisms capable of describing experimental results in imagery? I argue that it does not, first by exploring foundational achievements in imagery research then by showing that their neural basis cannot be specified. Newell and Simon’s methodological position accordingly stands, even 50 years later. Computational — as opposed to physiological — descriptions must be retained to characterize and study mental phenomena, even as we learn high-level details of their implementation via brain data. (shrink)

The computer is one of the most complex artifacts ever built. Given its complexity, it can be described from many different points of view. The aim of this paper is to investigate the representational structure and multifunctionality of a particular subset of computers, namely personal devices from a user-centred perspective. The paper also discusses the concept of “cognitive task”, as recently employed in some definitions of cognitive artifacts, and investigates the metaphysical properties of such artifacts. From a representational point of (...) view, the article introduces the concepts of artifactual meta-representation and of semi-transparency, two features that personal devices share with some cognitive and non-cognitive artifacts. Recognising the meta-representational nature of personal devices and of other cognitive artifacts, thus overcoming semi-transparency, is important for the understanding of why different artifacts offer us different cognitive affordances as well as different cognitive advantages. In this sense, it is not simply a theoretical achievement, but has some important practical consequences. In our highly technological world we can use different kinds of computers and artifacts for solving the same tasks, and we need to understand why some artifacts are better suited for some tasks than others. The ultimate characterisation of personal devices that emerges from this work is that of a sort of super-artifact. This special status is given to personal devices because of their distinctive features. They are in fact intrinsically multifunctional and meta-representational artifacts, with extremely variable structures. As super-artifacts, personal devices are characterised by macro-functionality and can be easily used as both cognitive artifacts and tools for other functions, depending on the kind of representations they instantiate. (shrink)

People often solve spatially presented cognitive problems more easily than their nonspatial counterparts. We explain this phenomenon by characterizing space as an inter-modality that provides common structure to different specific perceptual modalities. The usefulness of spatial structure for knowledge processing on different levels of granularity and for interaction between internal and external processes is described. Map representations are discussed as examples in which the usefulness of spatially organized symbols is particularly evident. External representations and processes can enhance internal representations and (...) processes effectively when the same structures and principles can be implicitly assumed. (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)

Twenty classes in ten schools with 627 sixth?grade students in five cities in Taiwan participated in this study. The research provides information on the performance differences among written computation, pictorial representation, symbolic representation and number sense. The results of One?way ANOVA analysis indicate that significant difference was found among WCT, PRT, SRT and NST tests, with F=536.327, p=0.000. The a posteriori comparisons show for each pair (WCT vs PRT, WCT vs SRT, WCT vs NST, PRT vs SRT and SRT (...) vs NST) significant difference at the 0.001 level (p=0.000), except for the pair comparison between PRT and NST. This implies that these Taiwanese students were highly skilled in written computation but their written skills were not equally transferred to use of non?computational paths that depended on symbolic representation, pictorial representation and number sense to solve similar problems. (shrink)

A symbolic computer model, employing the perceptual strategy, is presented for solving Tower of Hanoi problems. The model is calibrated—in terms of the number of problems solved, time taken, and number of moves made—to the performance of 20 normal subjects. It is then “lesioned” by increasing the decay rate of elements in working memory to model the performance of 20 patients with lesions to the prefrontal cortex. The model captures both the main effects of subject groups (patients and normal (...) controls) performance, and the subject groups (patients and normal controls) by problem difficulty interactions. This leads us to support the working memory hypothesis of frontal lobe functions, but for a narrow range of problems. (shrink)

Computation is central to the foundations of modern cognitive science, but its role is controversial. Questions about computation abound: What is it for a physical system to implement a computation? Is computation sufficient for thought? What is the role of computation in a theory of cognition? What is the relation between different sorts of computational theory, such as connectionism and symbolic computation? In this paper I develop a systematic framework that addresses all of these questions. Justifying the role of (...) computation requires analysis of implementation, the nexus between abstract computations and concrete physical systems. I give such an analysis, based on the idea that a system implements a computation if the causal structure of the system mirrors the formal structure of the computation. This account can be used to justify the central commitments of artificial intelligence and computational cognitive science: the thesis of computational sufficiency, which holds that the right kind of computational structure suffices for the possession of a mind, and the thesis of computational explanation, which holds that computation provides a general framework for the explanation of cognitive processes. The theses are consequences of the facts that (a) computation can specify general patterns of causal organization, and (b) mentality is an organizational invariant, rooted in such patterns. Along the way I answer various challenges to the computationalist position, such as those put forward by Searle. I close by advocating a kind of minimal computationalism, compatible with a very wide variety of empirical approaches to the mind. This allows computation to serve as a true foundation for cognitive science. (shrink)

Recent advances in the Super Linguistics of pictures have laid the Super Semantic foundation for modelling the phenomena of narrative sequencing and co-reference in pictorial and mixed linguistic-pictorial discourses. We take up the question of how one arrives at the pragmatic interpretations of such discourses. In particular, we offer an analysis of: (i) the discourse composition problem: how to represent the joint meaning of a multi-picture discourse, (ii) observed differences in narrative sequencing in prima facie equivalent linguistic vs (...) pictorial discourses, and (iii) the phenomenon of co-referencing across pictures. We extend Segmented Discourse Representation Theory to spell out a formal Super Pragmatics that applies to linguistic, pictorial and mixed discourses, while respecting the particular ‘genius’ of either medium and computing their distinctive pragmatic interpretations. (shrink)

Vera & Simon (1993a) have argued that the theories and methods known as situated action or situativity theory are compatible with the assumptions and methodology of the physical symbol systems hypothesis and do not require a new approach to the study of cognition. When the central criterion of computational universality is added to the loose definition of a symbol system which Vera and Simon provide, it becomes apparent that there are important incompatibilities between the two approaches such that situativity theory (...) cannot be subsumed within the symbol systems approach. Symbol systems and situativity theoretic approaches are, and should be seen to be, competing approaches to the study of cognition. (shrink)

Symbols should be grounded, as has been argued before. But we insist that they should be grounded not only in subsymbolic activities, but also in the interaction between the agent and the world. The point is that concepts are not formed in isolation (from the world), in abstraction, or "objectively." They are formed in relation to the experience of agents, through their perceptual/motor apparatuses, in their world and linked to their goals and actions. This paper takes a detailed look at (...) this relatively old issue, with a new perspective, aided by our work of computational cognitive model development. To further our understanding, we also go back in time to link up with earlier philosophical theories related to this issue. The result is an account that extends from computational mechanisms to philosophical abstractions. (shrink)

Recent advances in neuroscience lead to a wider realm for philosophy to include the science of the Darwinian-evolved computational brain, our inner world producing organ, a non-recursive super- Turing machine combining 100B synapsing-neuron DNA-computers based on the genetic code. The whole system is a logos machine offering a world map for global context, essential for our intentional grasp of opportunities. We start from the observable contrast between the chaotic universe vs. our orderly inner world, the noumenal cosmos. So far, (...) philosophy has been rehearsing our thoughts, our human-internal world, a grand painting of the outer world, how we comprehend subjectively our experience, worked up by the logos machine, but now we seek a wider horizon, how humans understand the world thanks to Darwinian evolution to adapt in response to the metaphysical gap, the chasm between the human animal and its environment, shaping the organism so it can deal with its variable world. This new horizon embraces global context coded in neural structures that support the noumenal cosmos, our inner mental world, for us as denizens of the outer environment. Kant’s inner and outer senses are fundamental ingredients of scientific philosophy. Several sections devoted to Heidegger, his lizard debunked, but his version of the metaphysical gap & his doctrine of the logos praised. Rorty and others of the behaviorist school discussed also. (shrink)