超图灵计算？纯粹理性计算？呼唤一种动态逻辑｜超越经典逻辑的计算：非结合 Dickson 代数中的奇异值分解
Ranking
No observed public metrics; popularity remains neutral/archived.
Merged summary
TL;DR - This translated book chapter argues that nonassociative Dickson algebras yield “nonclassical” singular values that appear incorrect at one algebraic level but become exact at the next. The author uses this result to motivate a dynamic logic beyond classical computation, while acknowledging that the leap to beyond-Turing computation is speculative.
- Nonassociativity creates multiple SVD derivation paths whose outputs can differ, despite sharing the same mean.
- Some anomalous singular values for vectors in (A_k) correspond exactly to singular values of related vectors in (A_{k+1}), with doubled multiplicities.
- The interpretation depends on algebraic level and observational perspective: a value can be invalid locally yet encode valid higher-dimensional information.
- The chapter connects this inductive hierarchy to hypercomputation and biological information processing, but does not establish a practical model that surpasses Turing machines.
Sources (1)
超图灵计算？纯粹理性计算？呼唤一种动态逻辑｜超越经典逻辑的计算：非结合 Dickson 代数中的奇异值分解
TL;DR - This translated book chapter argues that nonassociative Dickson algebras yield “nonclassical” singular values that appear incorrect at one algebraic level but become exact at the next. The author uses this result to motivate a dynamic logic beyond classical computation, while acknowledging that the leap to beyond-Turing computation is speculative.
- Nonassociativity creates multiple SVD derivation paths whose outputs can differ, despite sharing the same mean.
- Some anomalous singular values for vectors in (A_k) correspond exactly to singular values of related vectors in (A_{k+1}), with doubled multiplicities.
- The interpretation depends on algebraic level and observational perspective: a value can be invalid locally yet encode valid higher-dimensional information.
- The chapter connects this inductive hierarchy to hypercomputation and biological information processing, but does not establish a practical model that surpasses Turing machines.