Characterizing time computational complexity classes with polynomial differential equations
Riccardo Gozzi, Daniel Silva Graça · Computability · 2022
In this paper we show that several classes of languages from computational complexity theory, such as [Formula: see text], 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.