Switch to: Citations

References in:

Much Ado About Cognition

Mind 119 (476):1047-1066 (2010)

Add references

You must login to add references.
  1. Wide computationalism.Robert A. Wilson - 1994 - Mind 103 (411):351-72.
    The computational argument for individualism, which moves from computationalism to individualism about the mind, is problematic, not because computationalism is false, but because computational psychology is, at least sometimes, wide. The paper provides an early, or perhaps predecessor, version of the thesis of extended cognition.
    Download  
     
    Export citation  
     
    Bookmark   113 citations  
  • Intrinsic content, active memory and the extended mind.Andy Clark - 2005 - Analysis 65 (1):1-11.
    Download  
     
    Export citation  
     
    Bookmark   80 citations  
  • The extended mind.Andy Clark & David J. Chalmers - 1998 - Analysis 58 (1):7-19.
    Where does the mind stop and the rest of the world begin? The question invites two standard replies. Some accept the demarcations of skin and skull, and say that what is outside the body is outside the mind. Others are impressed by arguments suggesting that the meaning of our words "just ain't in the head", and hold that this externalism about meaning carries over into an externalism about mind. We propose to pursue a third position. We advocate a very different (...)
    Download  
     
    Export citation  
     
    Bookmark   1658 citations  
  • The soft constraints hypothesis: A rational analysis approach to resource allocation for interactive behavior.Wayne D. Gray, Chris R. Sims, Wai-Tat Fu & Michael J. Schoelles - 2006 - Psychological Review 113 (3):461-482.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Trading spaces: Computation, representation, and the limits of uninformed learning.Andy Clark & S. Thornton - 1997 - Behavioral and Brain Sciences 20 (1):57-66.
    Some regularities enjoy only an attenuated existence in a body of training data. These are regularities whose statistical visibility depends on some systematic recoding of the data. The space of possible recodings is, however, infinitely large type-2 problems. they are standardly solved! This presents a puzzle. How, given the statistical intractability of these type-2 cases, does nature turn the trick? One answer, which we do not pursue, is to suppose that evolution gifts us with exactly the right set of recoding (...)
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Trading spaces: Computation, representation, and the limits of uninformed learning.Andy Clark & Chris Thornton - 1997 - Behavioral and Brain Sciences 20 (1):57-66.
    Some regularities enjoy only an attenuated existence in a body of training data. These are regularities whose statistical visibility depends on some systematic recoding of the data. The space of possible recodings is, however, infinitely large – it is the space of applicable Turing machines. As a result, mappings that pivot on such attenuated regularities cannot, in general, be found by brute-force search. The class of problems that present such mappings we call the class of “type-2 problems.” Type-1 problems, by (...)
    Download  
     
    Export citation  
     
    Bookmark   44 citations