COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Decision Problems for Linear Recurrence Sequences

## Decision Problems for Linear Recurrence SequencesAdd to your list(s) Download to your calendar using vCal - Joel Ouaknine, University of Oxford
- Friday 29 November 2013, 16:00-17:00
- Room FW26, Computer Laboratory, William Gates Building.
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:- All Talks (aka the CURE list)
- Computer Laboratory talks
- Computing and Mathematics
- Logic and Semantics Seminar (Computer Laboratory)
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
Note that ex-directory lists are not shown. |
## Other listsIslamic Society Field Archaeology: Methods and Mayhem Program verification reading group.## Other talksExtreme Rowing LARMOR LECTURE - Nanosructured steel: the challenge of manufacture What shapes the human immune system? IoT Observatory: technological, legal and ethical challenges Some sociological aspects of the detection of gravitational waves Small-time fluctuations for sub-Riemannian diffusion loops |