The Tractable Cognition Thesis
Overview
Authors
Affiliations
The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance the Tractable Cognition thesis: Human cognitive capacities are constrained by computational tractability. This thesis, if true, serves cognitive psychology by constraining the space of computational-level theories of cognition. To utilize this constraint, a precise and workable definition of "computational tractability" is needed. Following computer science tradition, many cognitive scientists and psychologists define computational tractability as polynomial-time computability, leading to the P-Cognition thesis. This article explains how and why the P-Cognition thesis may be overly restrictive, risking the exclusion of veridical computational-level theories from scientific investigation. An argument is made to replace the P-Cognition thesis by the FPT-Cognition thesis as an alternative formalization of the Tractable Cognition thesis (here, FPT stands for fixed-parameter tractable). Possible objections to the Tractable Cognition thesis, and its proposed formalization, are discussed, and existing misconceptions are clarified.
Lessons for Theory from Scientific Domains Where Evidence is Sparse or Indirect.
Woensdregt M, Fusaroli R, Rich P, Modrak M, Kolokolova A, Wright C Comput Brain Behav. 2024; 7(4):588-607.
PMID: 39722900 PMC: 11666647. DOI: 10.1007/s42113-024-00214-8.
Building machines that learn and think with people.
Collins K, Sucholutsky I, Bhatt U, Chandra K, Wong L, Lee M Nat Hum Behav. 2024; 8(10):1851-1863.
PMID: 39438684 DOI: 10.1038/s41562-024-01991-9.
A model of conceptual bootstrapping in human cognition.
Zhao B, Lucas C, Bramley N Nat Hum Behav. 2023; 8(1):125-136.
PMID: 37845519 PMC: 11349578. DOI: 10.1038/s41562-023-01719-1.
Computational complexity drives sustained deliberation.
Hong T, Stauffer W Nat Neurosci. 2023; 26(5):850-857.
PMID: 37095398 PMC: 10166852. DOI: 10.1038/s41593-023-01307-6.
Neural Networks Track the Logical Complexity of Boolean Concepts.
Carcassi F, Szymanik J Open Mind (Camb). 2022; 6:132-146.
PMID: 36439063 PMC: 9692055. DOI: 10.1162/opmi_a_00059.