Characterizing time computational complexity classes with polynomial differential equations-Reference-Cited by-同舟云学术

Characterizing time computational complexity classes with polynomial differential equations

Published:2023-01-19 Issue:1 Volume:12 Page:23-57
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Gozzi Riccardo¹²,Graça Daniel³²

Affiliation:

1. Instituto Superior Técnico, Universidade de Lisboa, Portugal

2. Instituto de Telecomunicações, Portugal

3. Universidade do Algarve, Portugal

Abstract

In this paper we show that several classes of languages from computational complexity theory, such as EXPTIME, can be characterized in a continuous manner by using only polynomial differential equations. This characterization applies not only to languages, but also to classes of functions, such as the classes defining the Grzegorczyk hierarchy, which implies an analog characterization of the class of elementary computable functions and the class of primitive recursive functions.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference25 articles.

1. The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation

2. Polynomial differential equations compute all real computable functions on computable compact intervals;Bournez;Journal of Complexity,2007

3. O. Bournez, D.S. Graça and A. Pouly, Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length – the general purpose analog computer and computable analysis are two efficiently equivalent models of computations, in: Proc. 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani and D. Sangiorgi, eds, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 55, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016, pp. 109:1–109:15.

4. Computing with polynomial ordinary differential equations;Bournez;Journal of Complexity,2016

5. Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length;Bournez;Journal of the ACM,2017

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language;Revolutions and Revelations in Computability;2022