多项式常微分方程计算
Computing with Polynomial Ordinary Differential Equations
摘要:
1941年,克劳德·香农(Claude Shannon)提出了通用模拟计算机(GPAC)作为微分分析器的数学模型,也就是说作为当时连续时间模拟(机械,后来是电子)机器的模型。根据香农的论点,由GPAC生成的函数必须是微分代数的。众所周知,一些可计算函数,如欧拉的$Γ(x)=\int_{0}^{\infty}t^{x-1}e^{-t}dt$或黎曼的Zeta函数$ζ(x)=\sum_{k=0}^\infty \frac1{k^x}$不是微分代数的,这个论点在过去经常被用来证明GPAC不如数字计算强大。在JOC 2007中证明,如果考虑更现代的计算概念,即特别是如果可计算性不限于实时生成函数,则GPAC实际上等同于图灵机。我们的目的是首先讨论JOC 2007中涉及的计算概念的鲁棒性,通过建立本文中计算概念的自然变体导致相同的可计算性结果。其次,考虑到(时间)复杂度,我们探索了几个自然变量来测量计算的时间/空间复杂度。而令人惊讶的是,而定义一个强大的时间复杂度一般连续时间系统是一个众所周知的开放问题,我们证明,所有的变种实际上是等同的,即使在复杂的水平。因此,对于GPAC,或者对于多项式常微分方程的计算,似乎存在一个鲁棒的和定义良好的时间复杂度的概念。我们的证明的另一个副作用是,我们以某种方式表明,多项式常微分方程可以用作一种编程模型,并且有一个相当好的和强大的概念ODE编程。
英文摘要:
In 1941, Claude Shannon introduced the General Purpose Analog Computer(GPAC) as a mathematical model of Differential Analysers, that is to say as a model of continuous-time analog (mechanical, and later one electronic) machines of that time. Following Shannon's arguments, functions generated by GPACs must be differentially algebraic. As it is known that some computable functions like Euler's $Γ(x)=\int_{0}^{\infty}t^{x-1}e^{-t}dt$ or Riemann's Zeta function $ζ(x)=\sum_{k=0}^\infty \frac1{k^x}$ are not differentially algebraic, this argument has been often used to demonstrate in the past that the GPAC is less powerful than digital computation. It was proved in JOC2007, that if a more modern notion of computation is considered, i.e. in particular if computability is not restricted to real-time generation of functions, the GPAC is actually equivalent to Turing machines. Our purpose is first to discuss the robustness of the notion of computation involved in JOC2007, by establishing that natural variants of the notion of computation from this paper leads to the same computability result. Second, to go considerations about (time) complexity, we explore several natural variants for measuring time/space complexity of a computation. Rather surprisingly, whereas defining a robust time complexity for general continuous time systems is a well known open problem, we prove that all variants are actually equivalent even at the complexity level. As a consequence, it seems that a robust and well defined notion of time complexity exists for the GPAC, or equivalently for computations by polynomial ordinary differential equations. Another side effect of our proof is also that we show in some way that polynomial ordinary differential equations can be used as a kind of programming model, and that there is a rather nice and robust notion of ODE programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。