Switch to: References

Add citations

You must login to add citations.
  1. A fresh look at research strategies in computational cognitive science: The case of enculturated mathematical problem solving.Regina E. Fabry & Markus Pantsar - 2019 - Synthese 198 (4):3221-3263.
    Marr’s seminal distinction between computational, algorithmic, and implementational levels of analysis has inspired research in cognitive science for more than 30 years. According to a widely-used paradigm, the modelling of cognitive processes should mainly operate on the computational level and be targeted at the idealised competence, rather than the actual performance of cognisers in a specific domain. In this paper, we explore how this paradigm can be adopted and revised to understand mathematical problem solving. The computational-level approach applies methods from (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Long-arm functional individuation of computation.Nir Fresco - 2021 - Synthese 199 (5-6):13993-14016.
    A single physical process may often be described equally well as computing several different mathematical functions—none of which is explanatorily privileged. How, then, should the computational identity of a physical system be determined? Some computational mechanists hold that computation is individuated only by either narrow physical or functional properties. Even if some individuative role is attributed to environmental factors, it is rather limited. The computational semanticist holds that computation is individuated, at least in part, by semantic properties. She claims that (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On the Relation Between Marr's Levels: A Response to Blokpoel (2017).Richard P. Cooper & David Peebles - 2018 - Topics in Cognitive Science 10 (3):649-653.
    Blokpoel reminds us of the importance of consistency of function across Marr's levels, but we argue that the approach to ensuring consistency that he advocates—a strict relation through exact implementation of the higher level function at the lower level—is unnecessarily restrictive. We show that it forces overcomplication of the computational level (by requiring it to incorporate concerns from lower levels) and results in the sacrifice of the distinct responsibilities associated with each level. We propose an alternative, no less rigorous, potential (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation