scientific article; zbMATH DE number 2013793

zbMath1029.03034MaRDI QIDQ4437079

Campagnolo, Manuel Lameiras

Publication date: 7 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2509/25090001.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitydifferential equationsrecursion theoryContinuous-time computation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65)

Related Items (8)

Computability with polynomial differential equations ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ Real recursive functions and their hierarchy ⋮ Computability on reals, infinite limits and differential equations ⋮ Polynomial time over the reals with parsimony ⋮ A foundation for real recursive function theory ⋮ Computational bounds on polynomial differential equations ⋮ A Survey on Analog Models of Computation

This page was built for publication: