Computational complexity and black hole horizons

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 d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Fortschritte der Physik Ročník 64; číslo 1; s. 24 - 43
Hlavní autor: Susskind, Leonard
Médium: Journal Article
Jazyk:angličtina
Vydáno: Weinheim Blackwell Publishing Ltd 01.01.2016
Wiley Subscription Services, Inc
Témata:
Astrophysics
Black holes
Complexity
Horizon
ISSN:0015-8208, 1521-3978
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. 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 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.
Bibliografie:ArticleID:PROP201500092
ark:/67375/WNG-W2X1XG2Q-C
istex:6810ABB868C9AF87A753ABDA1817A78E10CE62BC
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0015-8208
1521-3978
DOI:10.1002/prop.201500092