BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Colloquium/Seminar
DESCRIPTION:Joshua A. Grochow\, Department of Computer Science\, University
of Colorado Boulder\n\nComputational Complexity\, Dynamical Systems\, and
Non-Convex Optimization\n\nFor a given computational problem\, computationa
l complexity asks the question of the resources needed - such as time\, spa
ce\, energy - by any algorithm which solves the problem. Despite algorithms
being a form of discrete dynamical system (in both time & space)\, the the
ory of dynamical systems has unfortunately played little role in computatio
nal complexity to date. In this talk\, I'll highlight several open question
s in computational complexity\, focusing on questions where analogies sugge
st that the methods of dynamical systems might be fruitfully applied. Along
the way\, we'll talk about the potential role in computational complexity
of: coarse-graining / reduced-order modeling\, condition number & robustnes
s\, and methods of comparing dynamical systems. My hope is that this will b
e the start of conversations around extending and leveraging the techniques
of dynamical systems and non-convex optimization to better understand the
nature of computation.
DTEND:20180316T220000Z
DTSTAMP:20240530T022448Z
DTSTART:20180316T210000Z
GEO:40.006791;-105.262818
LOCATION:Engineering Center\, ECCR 265
SEQUENCE:0
SUMMARY:Department Colloquium - Joshua A. Grochow
UID:tag:localist.com\,2008:EventInstance_3257433
URL:https://calendar.colorado.edu/event/department_colloquium_-_joshua_a_gr
ochow
END:VEVENT
END:VCALENDAR