14
Wednesday
Wed, 14/12/2016
4pm
Location
© (c) ENS de Lyon
Free
Conference given by Scott Aaronson, University of Texas, invited by the FRAMA
Computational complexity – the study of what can and can't be feasibly computed – has been interacting with physics in interesting and unexpected ways. This talk will include a crash course about quantum mechanics and the capabilities and limits of quantum computers. A touch on speculative models of computation that would go even beyond quantum computers will also be discussed.
Subject(s)
Keywords