|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Decision Problems for Linear Recurrence Sequences
If you have a question about this talk, please contact Jonathan Hayman.
Linear recurrence sequences (such as the Fibonacci numbers) permeate a vast number of areas of mathematics and computer science (in particular: program termination and probabilistic verification), and also have many applications in other fields such as economics, theoretical biology, and statistical physics. In this talk, I will focus on three fundamental decision problems for linear recurrence sequences, namely the Skolem Problem (does the sequence have a zero?), the Positivity Problem (are all terms of the sequence positive?), and the Ultimate Positivity Problem (are all but finitely many terms of the sequence positive?).
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCEB Alumni Speaker Series Milton 400th Anniversary Lectures Reading Group on Principles of Neural Design
Other talksMeasuring and visualising worldwide trends in cardiovascular risk factors Analyzing the Effects of Artisanal and Small-Scale Gold Mining on Agriculture for Policy Action; Evidence from Prestea Mining Region, Ghana Plant Based Diets, Obesity, and Health Beneftis Seeking the Gold Standard Measurement of Star Formation at the End of the Rainbow The Unified Transform, Imaging, Asymtotics Syria: Doctors Within, Without, and Beyond Borders