Computational complexity and black hole horizons
From MaRDI portal
Publication:2815130
DOI10.1002/PROP.201500092zbMATH Open1429.81019arXiv1402.5674OpenAlexW2117187503MaRDI QIDQ2815130
Author name not available (Why is that?)
Publication date: 27 June 2016
Published in: (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1402.5674
No records found.
No records found.
This page was built for publication: Computational complexity and black hole horizons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815130)
