Switch to: References

Add citations

You must login to add citations.
  1. Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.
    Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Theorem proving in artificial neural networks: new frontiers in mathematical AI.Markus Pantsar - 2024 - European Journal for Philosophy of Science 14 (1):1-22.
    Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine learning results (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Objectivity in Mathematics, Without Mathematical Objects†.Markus Pantsar - 2021 - Philosophia Mathematica 29 (3):318-352.
    I identify two reasons for believing in the objectivity of mathematical knowledge: apparent objectivity and applications in science. Focusing on arithmetic, I analyze platonism and cognitive nativism in terms of explaining these two reasons. After establishing that both theories run into difficulties, I present an alternative epistemological account that combines the theoretical frameworks of enculturation and cumulative cultural evolution. I show that this account can explain why arithmetical knowledge appears to be objective and has scientific applications. Finally, I will argue (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On Radical Enactivist Accounts of Arithmetical Cognition.Markus Pantsar - 2022 - Ergo: An Open Access Journal of Philosophy 9.
    Hutto and Myin have proposed an account of radically enactive (or embodied) cognition (REC) as an explanation of cognitive phenomena, one that does not include mental representations or mental content in basic minds. Recently, Zahidi and Myin have presented an account of arithmetical cognition that is consistent with the REC view. In this paper, I first evaluate the feasibility of that account by focusing on the evolutionarily developed proto-arithmetical abilities and whether empirical data on them support the radical enactivist view. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the development of geometric cognition: Beyond nature vs. nurture.Markus Pantsar - 2022 - Philosophical Psychology 35 (4):595-616.
    How is knowledge of geometry developed and acquired? This central question in the philosophy of mathematics has received very different answers. Spelke and colleagues argue for a “core cognitivist”, nativist, view according to which geometric cognition is in an important way shaped by genetically determined abilities for shape recognition and orientation. Against the nativist position, Ferreirós and García-Pérez have argued for a “culturalist” account that takes geometric cognition to be fundamentally a culturally developed phenomenon. In this paper, I argue that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics.Markus Pantsar - 2020 - 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Bootstrapping of integer concepts: the stronger deviant-interpretation challenge.Markus Pantsar - 2021 - Synthese 199 (3-4):5791-5814.
    Beck presents an outline of the procedure of bootstrapping of integer concepts, with the purpose of explicating the account of Carey. According to that theory, integer concepts are acquired through a process of inductive and analogous reasoning based on the object tracking system, which allows individuating objects in a parallel fashion. Discussing the bootstrapping theory, Beck dismisses what he calls the "deviant-interpretation challenge"—the possibility that the bootstrapped integer sequence does not follow a linear progression after some point—as being general to (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations