Nijmegen Institute for Cognition and Information, Radboud University Nijmegen.
Cogn Sci. 2008 Sep;32(6):939-84. doi: 10.1080/03640210801897856.
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.
人类思维/大脑是具有有限计算资源的有限系统这一认识,促使一些研究人员提出了可计算认知论点:人类认知能力受到计算可操作性的限制。如果这一论点成立,它将通过限制认知计算层面理论的空间,为认知心理学提供服务。为了利用这种限制,需要对“计算可操作性”进行精确且可行的定义。遵循计算机科学的传统,许多认知科学家和心理学家将计算可操作性定义为多项式时间可操作性,从而导致了 P-认知论点。本文解释了为什么 P-认知论点可能过于局限,有可能将真实的计算层面理论排除在科学研究之外。本文提出用 FPT-认知论点来取代 P-认知论点,作为可计算认知论点的替代形式化(这里,FPT 代表固定参数可操作性)。本文还讨论了对可计算认知论点及其提出的形式化的可能反对意见,并澄清了现有的误解。