Paper Info
Title
Subsymbolic computation theory for the human intuitive processor
Abstract
The classic theory of computation initiated by Turing and his contemporaries provides a theory of effective procedures--algorithms that can be executed by the human mind, deploying cognitive processes constituting the conscious rule interpreter. The cognitive processes constituting the human intuitive processor potentially call for a different theory of computation. Assuming that important functions computed by the intuitive processor can be described abstractly as symbolic recursive functions and symbolic grammars, we ask which symbolic functions can be computed by the human intuitive processor, and how those functions are best specified--given that these functions must be computed using neural computation. Characterizing the automata of neural computation, we begin the construction of a class of recursive symbolic functions computable by these automata, and the construction of a class of neural networks that embody the grammars defining formal languages.
Year
DOI
Venue
2012
10.1007/978-3-642-30870-3_68
CiE
Keywords
Field
DocType
intuitive processor,different theory,symbolic recursive function,subsymbolic computation theory,recursive symbolic functions computable,symbolic function,neural computation,human mind,classic theory,human intuitive processor,symbolic grammar
Rule-based machine translation,Discrete mathematics,Formal language,Computer science,Automaton,Models of neural computation,Theoretical computer science,Turing,Artificial intelligence,Artificial neural network,Recursion,Theory of computation
Conference
Citations 
PageRank 
References 
0
0.34
5
Authors
1
Name
Order
Citations
PageRank
Paul Smolensky121593.76