Nomura, Y. (2011). "Physical theories, eternal inflation, and the quantum universe". Journal of High Energy Physics. 2011 (11). Bibcode:2011JHEP...11..063N. arXiv:1104.2324 . doi:«10.1007/JHEP11(2011)063». doi.org.
Schmidhuber, Juergen (2000). "Algorithmic Theories of Everything". Sections in: Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science ():587-612 (2002). Section 6 in: the Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions. in J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory(COLT 2002), Sydney, Australia, Lecture Notes in Artificial Intelligence, pages 216-228. Springer, 2002. 13 (4): 1–5. Bibcode:2000quant.ph.11122S. arXiv:quant-ph/0011122 .
Nomura, Y. (2011). "Physical theories, eternal inflation, and the quantum universe". Journal of High Energy Physics. 2011 (11). Bibcode:2011JHEP...11..063N. arXiv:1104.2324 . doi:«10.1007/JHEP11(2011)063». doi.org.
Nomura, Y. (2011). "Physical theories, eternal inflation, and the quantum universe". Journal of High Energy Physics. 2011 (11). Bibcode:2011JHEP...11..063N. arXiv:1104.2324 . doi:«10.1007/JHEP11(2011)063». doi.org.
Schmidhuber, Juergen (2000). "Algorithmic Theories of Everything". Sections in: Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science ():587-612 (2002). Section 6 in: the Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions. in J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory(COLT 2002), Sydney, Australia, Lecture Notes in Artificial Intelligence, pages 216-228. Springer, 2002. 13 (4): 1–5. Bibcode:2000quant.ph.11122S. arXiv:quant-ph/0011122 .
J. Schmidhuber (2002): Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science 13(4):587–612 «IDSIA – Dalle Molle Institute for Artificial Intelligence». www.idsia.ch
J. Schmidhuber (2002): The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions. Proc. 15th Annual Conference on Computational Learning Theory (COLT 2002), Sydney, Australia, Lecture Notes in Artificial Intelligence, pp. 216–228. Springer: «IDSIA – Dalle Molle Institute for Artificial Intelligence». www.idsia.ch
mit.edu
space.mit.edu
Tegmark, Max (23 January 2003). «Parallel Universes»(PDF). space.mit.edu (PDF). Retrieved 7 February 2006.
