Predicative Analysis of Feasibility and Diagonalization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Predicative Analysis of Feasibility and Diagonalization

Résumé

Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of Bellantoni and Cook, and Leivant. Here, we refine predicative analysis by using a ramified Ackermann's construction of a non-primitive recursive function. We obtain an hierarchy of functions which characterizes exactly functions, which are computed in $O(n^k)$ over register machine model of computation. Then, we are able to diagonalize using dependent types in order to obtain an exponential function.
Fichier non déposé

Dates et versions

hal-00175412 , version 1 (28-09-2007)

Identifiants

  • HAL Id : hal-00175412 , version 1

Citer

Jean-Yves Marion. Predicative Analysis of Feasibility and Diagonalization. Typed Lambda Calculi and Applications, 8th International Conference - TLCA 2007, Jun 2007, Paris, France. pp.290-304. ⟨hal-00175412⟩
95 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More