Title: Computing without subtracting and/or dividing - Lecture 1
Speaker: Sergey Fomin (University of Michigan)
Abstract: Define the algebraic complexity of a rational function as the minimal number of arithmetic operations required to compute it. Can restricting the set of allowed operations dramatically increase the complexity (assuming the function is still computable in the restricted model)? In particular, what can happen if subtraction and/or division are disallowed?
Joint work with Dima Grigoriev and Gleb Koshevoy. Most of the material in this lecture will be accessible to undergraduate students.