相关论文: Algorithmic Theories of Everything
Recent no-go theorems on interpretations of quantum theory featuring an assumption of `Absoluteness of Observed Events' (AOE) are shown to have an unexpectedly strong corollary: one cannot reject AOE and at the same time assume that the…
We introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed…
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…
We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
According to the probability ranking principle, the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key…
Building upon the work of Chebyshev, Shannon and Kontoyiannis, it may be demonstrated that Chebyshev's asymptotic result: \begin{equation} \ln N \sim \sum_{p \leq N} \frac{1}{p} \cdot \ln p \end{equation} has a natural information-theoretic…
In non-relativistic as well as in special relativistic quantum theory, {\em mass} and {\em charge} are {\em pure numbers} appearing in various (quantum) operators and admit {\em any values}, {\it ie}, values for these quantities are to be…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
A mechanism is proposed that allows to interpret the temporal evolution of a physical system as a result of the inability of an observer to record its whole state and a simple example is given. It is based on a review of the concepts of…
The predictions that quantum theory makes about the outcomes of measurements are generally probabilistic. This has raised the question whether quantum theory can be considered complete, or whether there could exist alternative theories that…
The basic mathematical structure, QM-A, of the many worlds interpretation consists solely of the linear mathematics plus the Hilbert space properties of the state vectors. There is no collapse and there are no particles or hidden variables.…
The initial conditions of our universe appear to us in the form of a classical probability distribution that we probe with cosmological observations. In the current leading paradigm, this probability distribution arises from a quantum…
We present $\textit{Probabilistic Total Store Ordering (PTSO)}$ -- a probabilistic extension of the classical TSO semantics. For a given (finite-state) program, the operational semantics of PTSO induces an infinite-state Markov chain. We…
We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for…
In this short communication, it is shown a simple problem using quantum circuits for which the algorithmic information theory guarantee that the minimal length of the algorithm able to solve it grows exponentially with the number of qubits.
We compare the classical Kolmogorov and quantum probability models. We show that the gap between these model is not so huge as it was commonly believed. The main structures of quantum theory (interference of probabilities, Born's rule,…
This is the logical foundation for for Relativity Theory, Probability Theory, and for Quantum Theory. Contents is the following: 1 Introduction. 2 Classical logic. 3 Time and space. 3.1 Recorders. 3.2 Time. 3.3 Space. 3.4 Relativity. 4.…
Information theory is built on probability measures and by definition a probability measure has total mass 1. Probability measures are used to model uncertainty, and one may ask how important it is that the total mass is one. We claim that…