Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1707.03262 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911450415497216 |
|---|---|
| author | Levin, Leonid A. |
| author_facet | Levin, Leonid A. |
| contents | Non-compact symmetries cannot be fully broken by randomness since non-compact groups have no invariant probability distributions. In particular, this makes trickier the "Copernican" random choice of the place of the observer in infinite cosmology models.
This problem may be circumvented with what topologists call pointed spaces. Then randomness will be used only in building (infinite) models around the pre-designated "observation point", that thus would not need to be randomly chosen.
Additional complications come from the original randomness possibly being hidden. P. Gacs and A. Kucera proved that every sequence can be algorithmically generated from a random one. But Vladimir V'yugin discovered that randomized algorithms can with positive probability generate uncomputable sequences that are not algorithmically equivalent to any random ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1707_03262 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Assumptions of Randomness in Cosmology Models Levin, Leonid A. General Relativity and Quantum Cosmology Non-compact symmetries cannot be fully broken by randomness since non-compact groups have no invariant probability distributions. In particular, this makes trickier the "Copernican" random choice of the place of the observer in infinite cosmology models. This problem may be circumvented with what topologists call pointed spaces. Then randomness will be used only in building (infinite) models around the pre-designated "observation point", that thus would not need to be randomly chosen. Additional complications come from the original randomness possibly being hidden. P. Gacs and A. Kucera proved that every sequence can be algorithmically generated from a random one. But Vladimir V'yugin discovered that randomized algorithms can with positive probability generate uncomputable sequences that are not algorithmically equivalent to any random ones. |
| title | Assumptions of Randomness in Cosmology Models |
| topic | General Relativity and Quantum Cosmology |
| url | https://arxiv.org/abs/1707.03262 |