论文标题
对跨计算层次结构的意识理论进行正式化伪造
Formalizing Falsification for Theories of Consciousness Across Computational Hierarchies
论文作者
论文摘要
意识的科学研究目前正在以迅速发展的科学辩论的形式进行关键转变,涉及目前是否可以评估其科学有效性。这场辩论的最前沿是综合信息理论(IIT),被广泛认为是意识的杰出理论,因为它用标量数学度量的量化意识量化,称为$φ$,从原则上讲,可以衡量。以“不断发展的论点”形式的认识论问题通过证明它如何允许功能相同的系统在其预测意识上有差异,从而提供了IIT的反驳。这意味着即使在没有实验反驳的情况下,IIT和基于系统因果结构的任何其他提出的理论也可能已经伪造。但是,到目前为止,围绕意识理论的伪造问题的论点太抽象了,无法轻松确定其有效性的范围。在这里,我们通过提供一个可以用台式电子设备实现的功能等效机的简单示例来使这些抽象参数具体,这些机器可以采用有或没有反馈的同构数字电路的形式。这使我们能够明确证明可以评估意识理论的不同水平。在此计算层次结构中,我们展示了如何在有限状态自动机(FSA)级别同时伪造IIT,而在组合状态自动机(CSA)级别上的不可分割。我们使用此示例来说明意识理论的一系列更一般的标准:要避免不可分割或已经伪造的意识科学理论,就将推理程序留在计算层次结构中的给定级别上,必须不变。
The scientific study of consciousness is currently undergoing a critical transition in the form of a rapidly evolving scientific debate regarding whether or not currently proposed theories can be assessed for their scientific validity. At the forefront of this debate is Integrated Information Theory (IIT), widely regarded as the preeminent theory of consciousness because of its quantification of consciousness in terms a scalar mathematical measure called $Φ$ that is, in principle, measurable. Epistemological issues in the form of the "unfolding argument" have provided a refutation of IIT by demonstrating how it permits functionally identical systems to have differences in their predicted consciousness. The implication is that IIT and any other proposed theory based on a system's causal structure may already be falsified even in the absence of experimental refutation. However, so far the arguments surrounding the issue of falsification of theories of consciousness are too abstract to readily determine the scope of their validity. Here, we make these abstract arguments concrete by providing a simple example of functionally equivalent machines realizable with table-top electronics that take the form of isomorphic digital circuits with and without feedback. This allows us to explicitly demonstrate the different levels of abstraction at which a theory of consciousness can be assessed. Within this computational hierarchy, we show how IIT is simultaneously falsified at the finite-state automaton (FSA) level and unfalsifiable at the combinatorial state automaton (CSA) level. We use this example to illustrate a more general set of criteria for theories of consciousness: to avoid being unfalsifiable or already falsified scientific theories of consciousness must be invariant with respect to changes that leave the inference procedure fixed at a given level in a computational hierarchy.