Symbolic manipulations via subsymbolic computations

, &
In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 113--148 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Exploring the symbolic/subsymbolic continuum: A case study of RAAM.Douglas S. Blank, Lisa A. Meeden & James B. Marshall - 1992 - In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 113--148.
Autonomous generation of symbolic representations through subsymbolic activities.Ron Sun - 2013 - Philosophical Psychology 26 (6):888 - 912.
Beyond simple rule extraction: The extraction of planning knowledge from reinforcement learners.Ron Sun - unknown
On the nature of minds, or: Truth and consequences.Shimon Edelman - 2008 - Journal of Experimental and Theoretical Ai 20:181-196.
The other hard problem: How to bridge the gap between subsymbolic and symbolic cognition.Axel Cleeremans - 1998 - Behavioral and Brain Sciences 21 (1):22-23.
Symbolic parsing via subsymbolic rules.Stan C. Kwasny & Kanaan A. Faisal - 1992 - In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 209--236.
Hybrid connectionist models: Temporary bridges over the gap between the symbolic and the subsymbolic.Trent E. Lange - 1992 - In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 237--289.
Extensions of arithmetic for proving termination of computations.Clement F. Kent & Bernard R. Hodgson - 1989 - Journal of Symbolic Logic 54 (3):779-794.
On the spuriousness of the symbolic/subsymbolic distinction.Marin S. Marinov - 1993 - Minds and Machines 3 (3):253-70.
Random reals and possibly infinite computations Part I: Randomness in ∅'.Verónica Becher & Serge Grigorieff - 2005 - Journal of Symbolic Logic 70 (3):891-913.
Counterfactual Reduction and the Symbolic-Subsymbolic Relation.T. Vadén - 1993 - In Christopher Hookway (ed.), Philosophy and the Cognitive Sciences. Cambridge University Press.
The reality of the symbolic and subsymbolic systems.Andrew Woodfield & Adam Morton - 1988 - Behavioral and Brain Sciences 11 (1):58-58.
Conscious and unconscious knowledge: Mapping to the symbolic and subsymbolic levels of a hybrid architecture.D. Wallach & C. Lebiere - 2003 - In Luis Jimenez (ed.), Attention and Implicit Learning. John Benjamins.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.

Analytics

Added to PP
2014-02-01

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references