Cognition and the computational power of connectionist networks

Connection Science

Volumn 12, Issue 2, 2000, Pages 95-110

  Hadley, Robert F ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Biological plausibility; Cognition; Computability; Philosophical aspects

Indexed keywords

EID: 0034338060     PISSN: 09540091     EISSN: None     Source Type: Journal    
DOI: 10.1080/09540090050129745     Document Type: Article

References (33)

1. Bates, E. A., and Elman, J. L., 1993, Connectionism and the study of change. In M. H. Johnson (ed.) Brain Development and Cognition (Cambridge MA: Basil Blackwell).
2. Casey, M., 1996, The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Computation, 8: 1135-1178.
3. Church, A., 1956, Introduction to Mathematical Logic (Princeton NJ: Princeton University Press).
4. Churchland, P., 1990, Cognitive activity in artificial neural networks. In D. N. Osherson and E. E. Smith (eds) An Invitation to Cognitive Science: Thinking, Vol. 3 (Cambridge MA: MIT Press).
5. Cleeremans, A., Servan-Schreiber, D., and McClelland, J. L., 1989, Finite state automata and simple recurrent networks. Neural Computation, 1: 372-381.
6. Elman, J. L., 1990, Finding structure in time. Cognitive Science, 14: 179-212.
7. Elman, J. L., 1993, Learning and development in neural networks: the importance of starting small. Cognition, 48: 71-99.
8. Elman, J. L., Bates, E. A., Johnson, M. H., Karmiloff-Smith, A., Parisi, D., and Plunkett, K., 1996, Rethinking Innateness: A Connectionist Perspective on Development (Cambridge MA: MIT Press).
9. Fodor, J. A., and Pylyshyn, Z. W., 1988, Connectionism and cognitive architecture: a critical analysis. Cognition, 28: 3-71.
10. Gödel, K., 1931, Über formal unentscheidbare Sätze der Principia mathematica und verwandter System I. Monatschefte für Mathematik und Physik, 38: 173-198 (translated in van Heijenoort 1967).
11. Hadley, R. F., 1993, Connectionism, explicit rules, and symbolic manipulation. Minds and Machines, 3: 183-200.
12. Hadley, R. F., 1995, The explicit-implicit distinction. Minds and Machines, 5(2): 219-242.
13. Hadley, R. F., 1999, Connectionism and novel combinations of skills: implications for cognitive architecture. Minds and Machines, 9: 197-221.
14. Hadley, R. F., and Cardei, V. C., 1999, Language acquisition from sparse input without error feedback. Neural Networks, 12: 217-235.
15. Hadley, R. F., and Hayward, M. B., 1997. Strong semantic systematicity from Hebbian connectionist learning. Minds and Machines, 7: 1-37.
16. Hartman, E. J., Keeler, J. D., and Kowalski, J. M., 1990, Layered neural networks with Gaussian hidden units as universal approximations. Neural Computation, 2: 210-215.
17. Hornik, K., Stinchcombe, M., and White, H., 1989, Multilayer feedforward networks are universal approximators. Neural Networks, 2: 359-366.
18. Kilian, J., and Siegelmann, H. T., 1996, The dynamic universality of sigmoidal neural networks. Information and Computation. 128: 48-56.
19. Laird, J. E., Newell, A., and Rosenbloom, P. S., 1987, SOAR, An architecture for general intelligence. Artificial Intelligence, 33: 1-64.
20. Ling, C. X., 1994, Learning the past tense of English verbs: the Symbolic Pattern Associator vs. connectionist models. Journal of Artificial Intelligence Research, 1: 209-229.
21. Marcus, G., 1998, Rethinking eliminativc connectionism. Cognitive Psychology, 37: 243-282.
22. Moeser, S. D., and Bregman, A. S., 1973, Imagery and language acquisition. Journal of Verbal Learning and Verbal Behavior, 12: 91-98.
23. Niklasson, L. F., and van Gelder, T., 1994, On being systematically connectionist. Mind and Language, 9: 288-302.
24. Omlin, C. W., and Giles, C. L., 1996, Constructing deterministic finite-state automata in recurrent neural networks. Journal of the ACM, 43: 937-972.
25. Quinlan, R., 1992, C4.5; Programs for Machine Learning (Los Altos: Morgan Kaufman).
26. Rumelhart, D. E., Hinton, G., and Williams, R., 1986, Learning internal representations through error propagation. In D. E. Rumelhart, J. L. McClelland and the PDP Research Group (eds) Parallel Distributed Processing; Explorations in the Microstructure of Cognition, Vol. 1 (Cambridge MA: MIT Press).
27. Shastri, L. and Ajjanagadde, V. 1993, From simple associations to systematic reasoning: a connectionist representation of rules, variables and dynamic bindings using temporal synchrony. Behavioral and Brain Sciences, 16: 417-451.
28. Siegelmann, H. T., 1996, The simple dynamics of super Turing theories. Theoretical Computer Science, 168: 461-472.
29. th ACM Workshop on Computational Learning Theory, Pittsburgh, pp. 440-449.
30. Siegelmann, H. T., and Sontag, E. D., 1994, Analog computation via neural networks. Theoretical Computer Science, 131: 331-360.
31. Sontag, E. D., 1995, Automata and neural networks. In M. A. Arbib (ed.) The Handbook of Brain Theory and Neural Networks (Cambridge MA: MIT Press).
32. Thagard, P., 1989, Explanatory coherence. Behavioral and Brain Sciences, 12: 435-467.
33. van Heijenoort, J. (ed.) 1967 From Frege to Gödel: A Sourcebook of Mathematical Logic. 1897-1931 (Cambridge MA: Harvard University Press).