提出动态层级集概念，揭示不可计算物理过程如何改变计算层级。
Dynamic Level Sets
- 引入动态层级集新数学对象，基于自可调性原理
- 证明不可计算物理过程能重配置逻辑层级，超越经典图灵机
- 适合研究计算极限与物理实现的理论学者
本文识别并分析了2012年图灵百年会议论文《图灵不可计算计算》中隐含的数学概念——动态层级集。该概念区别于动力系统、拓扑学和可计算性理论中的标准概念。文章解释了一种新数学对象为何此前未被刻画，包括经典结果：偏倚 $p$（$p$ 为图灵可计算）的随机图灵机不比确定性图灵机计算能力更强。其核心机制是自可调性原理，即在每个计算步骤中，通过不可计算的物理过程重新配置不变逻辑层级的物理实现。
原文摘要 · Abstract (English)
A mathematical concept is identified and analyzed that is implicit in the 2012 paper Turing Incomputable Computation, presented at the Alan Turing Centenary Conference (Turing-100, Manchester). The concept, called dynamic level sets, is distinct from mathematical concepts in the standard literature on dynamical systems, topology, and computability theory. A new mathematical object is explained and why it may have escaped prior characterizations, including the classical result of de Leeuw, Moore, Shannon, and Shapiro that probabilistic Turing machines (with bias $p$ where $p$ is Turing computable) compute no more than deterministic ones. A key mechanism underlying the concept is the Principle of Self-Modifiability, whereby the physical realization of an invariant logical level set is reconfigured at each computational step by an incomputable physical process.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。