通用神经场计算
Universal neural field computation
摘要:
图灵机和哥德尔数是计算理论的重要支柱。因此,任何计算架构都需要展示它如何与图灵机相关,以及图灵计算的稳定实现是如何可能的。在本章中,我们在神经场环境中实现了通用图灵计算。为此,我们采用规范的符号图表示的图灵机从哥德尔编码的符号库和广义移位。由此产生的非线性动态自动机(NDA)是一个分段仿射线性映射的单位正方形,被划分成矩形域。而不是在相空间中的点动力学,我们然后考虑在相空间的概率分布函数(p.d.f.s)的功能动力学。这通常通过Frobenius-Perron积分变换来描述,该积分变换可以被视为在作为动态场论(DFT)的特征空间的单位正方形上的神经场方程。求解Frobenius-Perron方程得出,具有矩形支撑的均匀p.d.f.s再次映射到具有矩形支撑的均匀p.d.f.s上。我们将得到的表示称为\emph{dynamic field automaton}。
英文摘要:
Turing machines and Gödel numbers are important pillars of the theory of computation. Thus, any computational architecture needs to show how it could relate to Turing machines and how stable implementations of Turing computation are possible. In this chapter, we implement universal Turing computation in a neural field environment. To this end, we employ the canonical symbologram representation of a Turing machine obtained from a Gödel encoding of its symbolic repertoire and generalized shifts. The resulting nonlinear dynamical automaton (NDA) is a piecewise affine-linear map acting on the unit square that is partitioned into rectangular domains. Instead of looking at point dynamics in phase space, we then consider functional dynamics of probability distributions functions (p.d.f.s) over phase space. This is generally described by a Frobenius-Perron integral transformation that can be regarded as a neural field equation over the unit square as feature space of a dynamic field theory (DFT). Solving the Frobenius-Perron equation yields that uniform p.d.f.s with rectangular support are mapped onto uniform p.d.f.s with rectangular support, again. We call the resulting representation \emph{dynamic field automaton}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。