arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.02241cs.LOcs.CCcs.DM
收藏

递归格式、离散微分方程和多项式时间计算的特征

Recursion schemes, discrete differential equations and characterization of polynomial time computation

Olivier Bournez, Arnaud Durand, Sabrina Ouazzani

摘要:

本文研究离散常微分方程的表达能力和计算能力。它提出了一个新的框架,使用离散常微分方程作为计算的中心工具,并提供了几个隐式的复杂性和可计算性类的特征。建议的框架提出了一个原始的复杂性和可计算性类的观点。它还统一在一个优雅的设置,已提出的各种结构,为这些类的特点。这包括科巴姆的和,Bellantoni和库克的定义多项式时间和后来的扩展的方法,以及最近的特点的可计算性和复杂性类的常微分方程。它还有助于理解模拟计算和计算理论的经典离散模型之间的关系。从更技术性的角度,本文指出了线性(离散)常微分方程和经典常微分方程工具的基本作用,如变量的变化,以捕获可计算性和复杂性的措施,或作为编程的工具,各种算法。

英文摘要:

This papers studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs). It presents a new framework using discrete ODEs as a central tool for computation and provides several implicit characterizations of complexity and computability classes. The proposed framework presents an original point of view on complexity and computability classes. It also unifies in an elegant settings various constructions that have been proposed for characterizing these classes. This includes Cobham's and, Bellantoni and Cook's definition of polynomial time and later extensions on the approach, as well as recent characterizations of computability and complexity by classes of ordinary differential equations. It also helps understanding the relationships between analog computations and classical discrete models of computation theory. At a more technical point of view, this paper points out the fundamental role of linear (discrete) ordinary differential equations and classical ODE tools such as changes of variables to capture computability and complexity measures, or as a tool for programming various algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑