Switch to: References

Add citations

You must login to add citations.
  1. Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics.Markus Pantsar - 2021 - Minds and Machines 31 (1):75-98.
    In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Enculturated Move From Proto-Arithmetic to Arithmetic.Markus Pantsar - 2019 - Frontiers in Psychology 10.
    The basic human ability to treat quantitative information can be divided into two parts. With proto-arithmetical ability, based on the core cognitive abilities for subitizing and estimation, numerosities can be treated in a limited and/or approximate manner. With arithmetical ability, numerosities are processed (counted, operated on) systematically in a discrete, linear, and unbounded manner. In this paper, I study the theory of enculturation as presented by Menary (2015) as a possible explanation of how we make the move from the proto-arithmetical (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Metaphor and the Philosophical Implications of Embodied Mathematics.Bodo Winter & Jeff Yoshimi - 2020 - Frontiers in Psychology 11.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark