Abstract
Computation and Cognition. To understand computing with neural networks and how cognitive processes can be implemented in this way, it is imperative to distinguish between two kinds of machines and the forms of computation they produce: Finite-state automata (FA’s), and machines such as the Turing machine (TM) or the pushdown automaton (PA). The difference concerns the use of (working) memory. In an FA, the memory is interwoven with the program. To increase processing capacity, new states have to be added to the machine, with new connections between these states and the old states. As a result, the structure of the machine changes and thus the function computed by the machine. In contrast, a TM or a PA is an FA connected to a memory that is external to the FA. The FA is the program of the machine. Because the FA (program) is separated from the memory, the processing capacity (memory) of the machine can be increased without changing the program, and thus without changing the function computed. To use an external memory, a program in a TM or PA has to produce representations (symbols) that can be stored in and retrieved from the memory. This shows why computation of this kind is symbol manipulation: The program manipulates symbols by the processes of storing and retrieving. With a repeated use of storing and retrieving, combinations (strings) of symbols can be stored in the memory, to be used for recognition or production.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Van der Velde, F. (subm). Integrating connectionism and symbol manipulation: The importance of implementation. Behavioral and Brain Sciences.
Amsel, A., & Rashotte, M. E. (1984). Mechanisms of adaptive behavior: Clark L. Hull’s theoretical papers, with commentary. N.Y. Columbia UP
Sereno, M. I. (1991). Language and the primate brain. Proceedings 13th annual conference of the cognitive science society. Hillsdale: Erlbaum.
Newell, A. (1990). Unified theories of cognition. Cambridge, MA: Harvard University Press.
Tanaka, K. (1992). Inferotemporal cortex and higher visual functions. Current Opinion in Neurobiology, 2, 502–505.
Amit, D. J. (in press). The Hebbian paradigm reintegrated: Local reverberations as internal representations. Behavioral and Brain Sciences.
Dennett, D. C. (1991). Consciousness explained. London: Penguin.
Van der Velde, F. (1995). Symbol manipulation with neural networks: Production of a context-free language using a modifiable working memory. Connection Science 7, (3) (forthcoming).
Anderson, J. A. (1994). Associative computation. In: d’Ydewalle, Eelen & Bertelson (Eds.), International perspectives on psychological science, Vol 2. (pp. 95–118 ), Hillsdale: Erlbaum.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag London Limited
About this paper
Cite this paper
van der Velde, F. (1995). Computation, Cognition, and Neural Networks. In: Kappen, B., Gielen, S. (eds) Neural Networks: Artificial Intelligence and Industrial Applications. Springer, London. https://doi.org/10.1007/978-1-4471-3087-1_20
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3087-1_20
Publisher Name: Springer, London
Print ISBN: 978-3-540-19992-2
Online ISBN: 978-1-4471-3087-1
eBook Packages: Springer Book Archive