The Methods of Approximation and Lifting in Real Computation

DOI10.1016/j.entcs.2006.09.013zbMath1262.03079OpenAlexW2050204928MaRDI QIDQ4921452

Campagnolo, Manuel Lameiras, Kerry Ojakian

Publication date: 10 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.09.013

zbMATH Keywords

computable analysisreal recursive functionselementary computable

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)

Related Items (1)

The elementary computable functions over the real numbers: applying two new techniques

Cites Work

• Recursion theory on the reals and continuous-time computation
• An analog characterization of the Grzegorczyk hierarchy
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Computable functionals
• Unnamed Item
• Unnamed Item

This page was built for publication: The Methods of Approximation and Lifting in Real Computation