Related papers: A Computational Anthropic Principle: Where is the …
We suggest to combine the Anthropic Principle with the Many-Worlds Interpretation of Quantum Theory. Realizing the multiplicity of worlds it provides an opportunity of explanation of some important events which are assumed to be extremely…
During the last centuries of human history, many questions was repeated in connection with the great problems of the existence and origin of human beings, and also of the Universe. The old questions of common sense and philosophy have not…
Limitation of computational resources is considered as a universal principle that for simulation is as fundamental as physical laws are. It claims that all experimentally verifiable implications of physical laws can be simulated by the…
If the parameters defining the physics of our universe departed from their present values, the observed rich structure and complexity would not be supported. This article considers whether similar fine-tuning of parameters applies to…
Computationalism provides a framework for understanding how a mathematically describable physical world could give rise to conscious observations without the need for dualism. A criterion is proposed for the implementation of computations…
The existence of multiple regions of space beyond the observable Universe (within the so-called "multiverse") where the vacuum energy density takes different values, has been postulated as an explanation for the low non-zero value observed…
The fine-tuning of the universe for life, the idea that the constants of nature (or ratios between them) must belong to very small intervals in order for life to exist, has been debated by scientists for several decades. Several criticisms…
I describe reasons to think we are living in an eternally inflating multiverse where the observable "constants" of nature vary from place to place. The major obstacle to making predictions in this context is that we must regulate the…
There is good evidence that quantum computers are more powerful than classical computers, and that various simple modifications of quantum theory yield computational power that is dramatically greater still. However, these modifications…
The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature --- one based on…
It is explained in detail why the Anthropic Principle (AP) cannot yield any falsifiable predictions, and therefore cannot be a part of science. Cases which have been claimed as successful predictions from the AP are shown to be not that.…
The anthropic principle is based on the observation that, within narrow bounds, the laws of physics are such as to have allowed the evolution of life. The string theoretic approach to understanding this observation is based on the…
Although ultimately motivated by quantum theoretical considerations, Everett's many-world idea remains valid, as an approximation, in the classical limit. However to be applicable it must in any case be applied in conjunction with an…
Human societies continuously transform scattered information into collective judgments and coordinated action, whether through markets discovering prices, governments allocating resources, communities enforcing norms, or science converging…
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
We show that anthropic selection emerges inevitably in the general framework for prediction in quantum cosmology. There the predictions of anthropic reasoning depend on the prior implied by the universe's quantum state. To illustrate this…
A century ago, discoveries of a serious kind of logical error made separately by several leading mathematicians led to acceptance of a sharply enhanced standard for rigor within what ultimately became the foundation for Computer Science. By…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
The principle of maximum entropy is a broadly applicable technique for computing a distribution with the least amount of information possible constrained to match empirical data, for instance, feature expectations. We seek to generalize…
Many of the classic problems of particle physics appear in a very different light when viewed from the perspective of the multiverse. Most importantly the two great ``fine tuning'' problems that motivate the field are far less serious when…