UNAM
Usted está aquí: Inicio / Actividades académicas / Carrusel actividades académicas / Coloquio del IMUNAM - C. U., marzo 2026

Coloquio del IMUNAM - C. U., marzo 2026

Computational Complexity and Explanations in Physics
Scott Aaronson, Universidad de Texas en Austin
Martes 17 de marzo a las 12:00 horas.

https://www.matem.unam.mx/actividades/coloquio/cu/actividades/computational-complexity-and-explanations-in-physics

Resumen:

The fact, or conjecture, of certain computational problems being intractable (that is, needing astronomical amounts of time to solve) clearly affects our ability to learn about physics.  But could computational intractability also play a direct role in physical explanations themselves?  I'll consider this question by examining three possibilities:

(1) If quantum computers really take exponential time to simulate using classical computers, does that militate toward the many-worlds interpretation of quantum mechanics, as David Deutsch famously proposed?

(2) Are certain speculative physical ideas (e.g., time travel to the past or nonlinearities in quantum mechanics) disfavored, over and above any other reasons to disfavor them, because they would lead to "absurd computational superpowers"?

(3) Do certain effective descriptions in physics work only because of the computational intractability of violating those descriptions -- as for example with Harlow and Hayden's resolution of the "firewall paradox" in black hole thermodynamics, or perhaps even the Second Law of Thermodynamics itself?


  • Coloquio del IMUNAM - C. U., marzo 2026

    Coloquio del IMUNAM - C. U., marzo 2026

    Auditorio Alfonso Nápoles Gándara, Instituto de Matemáticas