Section: New Results

Complexity in Recursive Analysis

Participant : Emmanuel Hainry.

In [30] , we present a characterization of polytime computable functions in the Recursive Analysis setting. This paper in fact presents a generic framework for lifting characterizations of complexity or computability classes in the classical setting into analog characterizations in Recursive Analysis.