Statut | Confirmé |
Série | STR-LPT-ENS-HE |
Domaines | hep-th |
Date | Vendredi 23 Mars 2018 |
Heure | 14:00 |
Institut | LPTENS |
Salle | LPTENS library |
Nom de l'orateur | Douglas |
Prenom de l'orateur | Michael |
Addresse email de l'orateur | |
Institution de l'orateur | Stony Brook |
Titre | Computational complexity of cosmology in string theory |
Résumé | Title: Computational complexity of cosmology in string theory Abstract: We describe a new approach for quantum cosmology based on computational complexity. By defining a cosmology as a space-time containing a vacuum with specified properties (for example small cosmological constant) together with rules for how time evolution will produce the vacuum, we can associate global time in a multiverse with clock time on a supercomputer which simulates it. We argue for a principle of ``limited computational complexity" governing early universe dynamics as simulated by this supercomputer, which translates to a global measure for regulating the infinities of eternal inflation. We also give various definitions of the computational complexity of a cosmology, and argue that there are only a few natural complexity classes. |
Numéro de preprint arXiv | 1706.06430 |
Commentaires | |
Fichiers attachés |
Pour obtenir l' affiche de ce séminaire : [ Postscript | PDF ]
|
[ English version ] |