vix.ing · top · new · best · stats

Computational complexity and black hole horizons

2016/01/01 by Leonard Susskind · 784 citations
Physics and Astronomy · #Algorithm #Astronomy #Black Holes and Theoretical Physics #Black hole (networking) #Charged black hole #Computational complexity theory #Computer science #Computer security #Cosmology and Gravitation Theories #Event horizon #Extremal black hole #Firewall (physics) #Horizon #Noncommutative and Quantum Gravity Theories #Physics #Scrambling #Theoretical computer science #Theoretical physics

paper · doi:10.1002/prop.201500092

published in Fortschritte der Physik 64(1), 24-43 (Wiley)

openalex publication_date 2016/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that while creating firewalls is possible, it is extremely difficult and probably impossible for black holes that form in sudden collapse, and then evaporate. On the other hand if the radiation is bottled up then after an exponentially long period of time firewalls may be common. It is possible that gravity will provide tools to study problems of complexity; especially the range of complexity between scrambling and exponential complexity.

Citations

Cited by

Related