|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 listsHistory of Modern Medicine and Biology Isotope Coffee: Geochemistry and Petrology Seminars Department of Earth Sciences Explore Islam Week 2013
Other talksUnpicking the phenotypic and genotypic heterogeneity underlying autism Mixing dynamics in pulsed fuel jets Fertility, Gender and the Family in Twentieth-Century East Africa Novel proteins encoded by genomes of vector-borne dsRNA viruses and their involvement in innate immune modulation both in the arthropod vector and mammalian host Intracellular DNA recognition by the innate immune system Alumni in Industry Day