Decision problems for linear recurrences involving arbitrary real numbers

We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show that for each problem there exists a correct partial algorith...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 17, Issue 3
Hlavný autor:	Neumann, Eike
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 10.08.2021
Predmet:	computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!