In Metamagical themas (pp. 631--665). New York: Basic Books. Holland, J. H. (1986). Escaping brittleness: The possibilities of general purpose machine learning algorithms applied to parallel rule-based systems. In R. Michalski, J. Carbonell, & T.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Subsymbolic Computation and the Chinese Room - Chalmers (1992)   (9 citations)  (Correct)

....are certainly not competing with each other. Rather, each has a different goal. Through the pursuit of both projects, we might be able to come up with adequate accounts of both externalist and internalist content. Taken together, the projects would thus support a two factor theory of meaning (Block, 1986), which many have argued can be the only kind of complete theory of meaning. framework. The emptiness of these such symbolic tokens, according to Hofstadter, arises from their passivity. They are dead, lifeless tokens, which are only manipulated by some overlying program. There is nothing ....

In Metamagical themas (pp. 631--665). New York: Basic Books. Holland, J. H. (1986). Escaping brittleness: The possibilities of general purpose machine learning algorithms applied to parallel rule-based systems. In R. Michalski, J. Carbonell, & T.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC