Related papers: Cosmic Logic: a Computational Model
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
This thesis investigates cosmological particle production within Quantum Field Theory in Curved Spacetimes, both as a dark matter mechanism and through analog simulations using Bose-Einstein condensates. While a full theory of Quantum…
We present COSMOCR, a numerical code for the investigation of cosmic ray related studies in computational cosmology. The code follows the diffusive shock acceleration, the mechanical and radiative energy losses and the spatial transport of…
This paper concerns the so-called cosmological constant problem. In order to solve it, we propose a toy model providing an extension of the dimensionality of spacetime, with an additional spatial dimension which is macroscopically…
We explore a variety of statistics of clusters selected with cosmic shear measurement by utilizing both analytic models and large numerical simulations. We first develop a halo model to predict the abundance and the clustering of weak…
We present validation tests of emulator-based halo model method for cosmological parameter inference, assuming hypothetical measurements of the projected correlation function of galaxies, $w_{\rm p}(R)$, and the galaxy-galaxy weak lensing,…
The aim of cosmological simulations is to reproduce the properties of the observed Universe, serving as tools to test structure and galaxy formation models. Constrained simulations of our local cosmological region up to a few hundred Mpc/h…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
The central idea of this work is the concept of prespace, a hypothetical structure that is postulated to underlie the fabric of space or space-time. I consider how such a structure could relate to space and space-time, and the implications…
Though many safety-critical software systems use floating point to represent real-world input and output, programmers usually have idealized versions in mind that compute with real numbers. Significant deviations from the ideal can cause…
Approaching limitations of digital computing technologies have spurred research in neuromorphic and other unconventional approaches to computing. Here we argue that if we want to systematically engineer computing systems that are based on…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
The measurement problem is the issue of explaining how the objective classical world emerges from a quantum one. Here we take a different approach. We assume that there is an objective classical system, and then ask that the standard rules…
The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially,…
We show that most of cutoff measures of the multiverse violate some of the basic properties of probability theory when applied repeatedly to predict the results of local experiments. Starting from minimal assumptions, such as Markov…
Turing Machines (TMs) are the canonical model of computation in computer science and physics. We combine techniques from algorithmic information theory and stochastic thermodynamics to analyze the thermodynamic costs of TMs. We consider two…
We investigate a number of simple toy models to explore interesting relationships between dynamics and typicality. We start with an infinite model that has been proposed as an illustration of how non-ergodic dynamics can produce interesting…
Recent studies of the detectability of cosmic topology of nearly flat universes have often concentrated on the range of values of $\Omega_{0}$ given by current observations. Here we study the consequences of taking the bounds on…
Using elementary cellular automata (CA) as an example, we show how to coarse-grain CA in all classes of Wolfram's classification. We find that computationally irreducible (CIR) physical processes can be predictable and even computationally…
At a first glance the Theory of computation relies on potential infinity and an organization aimed at solving a problem. Under such aspect it is like Mendeleev theory of chemistry. Also its theoretical development reiterates that of this…