An hierarchy of terminating algorithms with semantic interpretation termination proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

An hierarchy of terminating algorithms with semantic interpretation termination proofs

Abstract

We study deterministic (non-deterministic) algorithms define by mean of confluent (resp. non-confluent) rewrite system admitting polynomial interpretation termination proofs. Data structures of the algorithms include strings, lists and trees. We classify them according to the interpretations of constructors This leads to the definition of six classes, which turn out to be exactly the deterministic (non-deterministic) poly-time, linear exponential-time and doubly linear exponential time computable functions when the class is based on confluent (resp. non-confluent) systems. Next, we demonstrate that functions with exponential interpretation termination proofs are super-elementary.
Not file

Dates and versions

inria-00098563 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098563 , version 1

Cite

Jean-Yves Marion. An hierarchy of terminating algorithms with semantic interpretation termination proofs. [Intern report] 98-R-273 || marion98a, 1998, 17 p. ⟨inria-00098563⟩
64 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More