Skolem's Problem -- On the Border between Decidability and Undecidability (2005)
by
Vesa Halava
,
Tero Harju
,
Mika Hirvensalo
,
Juhani Karhumäki
| Citations: | 7 - 0 self |
BibTeX
@MISC{Halava05skolem'sproblem,
author = {Vesa Halava and Tero Harju and Mika Hirvensalo and Juhani Karhumäki},
title = {Skolem's Problem -- On the Border between Decidability and Undecidability},
year = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give a survey of Skolem’s problem for linear recurrence sequences. We cover the known decidable cases for recurrence depths of at most 4, and give detailed proofs for these cases. Moreover, we shall prove that the problem is decidable for linear recurrences of depth 5.
