Characterizing time computational complexity classes with polynomial differential equations

DOI10.3233/COM-210384OpenAlexW4294266235WikidataQ115222735 ScholiaQ115222735MaRDI QIDQ5880938

Unnamed Author, Daniel Silva Graça

Publication date: 9 March 2023

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-210384

zbMATH Keywords

analog computationEXPTIMEGrzegorczyk hierarchycomputation with polynomial ordinary differential equations

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Related Items (1)

Programming with ordinary differential equations: some first steps towards a programming language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of solving polynomial differential equations over unbounded domains
• Computing with polynomial ordinary differential equations
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Computational complexity of real functions
• Classical recursion theory. Vol. II
• Analog computers and recursive functions over the reals.
• On the functions generated by the general purpose analog computer
• An analog characterization of the Grzegorczyk hierarchy
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Computability with polynomial differential equations
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Some recent developments on Shannon's General Purpose Analog Computer
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
• Automata, Languages and Programming
• Mathematical Theory of the Differential Analyzer
• Theory and Applications of Models of Computation
• Computational Complexity
• Iteration, inequalities, and differentiability in analog computers

This page was built for publication: Characterizing time computational complexity classes with polynomial differential equations