@article{smolensky2012symbolic,
author = {Smolensky, Paul},
title = {Symbolic Functions From Neural Computation},
year = {2012},
month = {January},
abstract = {Is thought computation over ideas? Turing, and many cognitive scientists since, have assumed so, and formulated computational systems in which meaningful concepts are encoded by symbols which are the objects of computation. Cognition has been carved into parts, each a function defined over such symbols. This paper reports on a research program aimed at computing these symbolic functions without computing over the symbols. Symbols are encoded as patterns of numerical activation over multiple abstract neurons, each neuron simultaneously contributing to the encoding of multiple symbols. Computation is carried out over the numerical activation values of such neurons, which individually have no conceptual meaning. This is massively parallel numerical computation operating within a continuous computational medium. The paper presents an axiomatic framework for such a computational account of cognition, including a number of formal results. Within the framework, a class of recursive symbolic functions can be computed. Formal languages defined by symbolic rewrite rules can also be specified, the subsymbolic computations producing symbolic outputs that simultaneously display central properties of both facets of human language: universal symbolic grammatical competence and statistical, imperfect performance. [From a Theme Issue, "The foundations of computation, physics and mentality: the Turing legacy".]},
url = {http://approjects.co.za/?big=en-us/research/publication/symbolic-functions-from-neural-computation/},
pages = {3543-3569},
journal = {Philosophical Transactions of the Royal Society A},
volume = {370},
edition = {Philosophical Transactions of the Royal Society A},
}