We advance the hypothesis that human mathematical reasoning, constrained by both the undecidability and the computational intractability of even modest logical fragments, relies fundamentally on pattern matching from domains external to pure deduction. The most prolific reservoir of such patterns is the natural world, whose physical laws and biological systems have undergone billions of years of ``pre-computation''and already exhibit surprisingly innovative solutions. To ground this claim, we trace the history of the Fourier transform and relevant mathematics, from the vibrating string controversy to the hear equation and subsequent formalisms prevalent in mathematics. At each critical juncture, a physics problem forced the acceptance or creation of a mathematical tool that pure formal reasoning failed to anticipate or, worse, human reasoning had resisted. We further survey the landscape of logical complexity, from NP-hard propositional satisfiability to the non-elementary decision-procedures for monadic second-order theories, to demonstrate that even when a logic is decidable, the resources required for worst-case deduction are astronomically prohibitive. We argue that these barriers make physics-inspired pattern matching not just a historical accident but a cognitive necessity. Finally, we draw the consequence for artificial intelligence: if pure reasoning is constitutively insufficient, then any system aiming at human-level mathematical creativity must embed a vast store of cross-domain patterns rather than rely on deduction alone. This furnishes a principled justification for the enormous scale of contemporary large language models.
This article advances a categorial challenge to physicalistic versions of naturalized epistemology as an account of logico-mathematical knowledge and practice. It argues that, qua physically constituted, any putative rule-governed system is logico-mathematically indeterminate: physical facts are systematically insuffic...
Antonio Ramos-Díaz· Principia: An International...· 0 citations
The paper argues that AI does not abolish rationality or reduce truth to mere prediction, and makes explicit a conception of rationality already embedded in the history of mathematics and science, where knowledge advances through controlled approximation, convergence, and bounded error.
Sakos Ikonomopoulos· Proceedings of the European...· 0 citations
Abstract Can physical reality be fully captured by an algorithmic Theory of Everything? We argue not. Gödelian incompleteness shows that no sound, recursively axiomatizable formalism proves all truths of a sufficiently rich domain, while Tarskian undefinability shows that no such formalism defines its own truth predica...
Mir Faizal, Arshid Shabir· Metaphysica· 0 citations
The article concludes that formal validity and practical rationality answer to different criteria of success, that the empirical superiority of statistical prediction over human judgment does not collapse this distinction, and that the operative difference lies in the structure of failure rather than in its frequency.
Zhe Ji· International journal of com...· 0 citations
This paper develops a nativist approach to mathematical knowledge as an alternative account within the philosophy of mathematics. Rather than beginning with the ontological status of mathematical objects, it argues that any satisfactory account of mathematical knowledge should address three closely related questions: h...
An-An Zhou, Yue Liu· Philosophies· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.