Computability of recurrence equations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Computability of recurrence equations

Yannick Saouter
Patrice Quinton
  • Function : Author
  • PersonId : 833432


This paper investigates the computability of recurrence equations. We first recall the results established by Karp et al. on the computability of systems of uniform recurrence equations, by Rao on regular iterative arrays and Joinnault's undecidability result on the computability of conditional systems of uniform recurrence equations with non bounded domain. Then we consider systems of parameterized affine recurrence equations, that is to say, systems of recurrence equations whose domains depend linearly on a size parameter and we establish that the computability of such systems is also undecidable.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1203.pdf (1.16 Mo) Télécharger le fichier

Dates and versions

inria-00075355 , version 1 (24-05-2006)


  • HAL Id : inria-00075355 , version 1


Yannick Saouter, Patrice Quinton. Computability of recurrence equations. [Research Report] RR-1203, INRIA. 1990. ⟨inria-00075355⟩
190 View
136 Download


Gmail Facebook Twitter LinkedIn More