Related papers: Validating the Universe in a Box
It is becoming increasingly apparent that probabilistic approaches can overcome conservatism and computational complexity of the classical worst-case deterministic framework and may lead to designs that are actually safer. In this paper we…
We propose a tool-supported methodology for design-space exploration for embedded systems. It provides means to define high-level models of applications and multi-processor architectures and evaluate the performance of different deployment…
Algorithmic robustness refers to the sustained performance of a computational system in the face of change in the nature of the environment in which that system operates or in the task that the system is meant to perform. Below, we motivate…
Cosmic voids, the less dense patches of the Universe, are promising laboratories to extract cosmological information. Thanks to their unique low density character, voids are extremely sensitive to diffuse components such as neutrinos and…
Gravitational-collapse-based explanations of the cosmic web lead to problems in estimating the total mass in the universe. A first-principles several-scales model is developed here for the structural organisation of cosmic matter in a flat…
Gravitational lensing has been identified as a powerful tool to address fundamental problems in astrophysics at different scales, ranging from exoplanet identification to dark energy and dark matter characterization in cosmology. Image…
Reconstructing the density fluctuations in the early Universe that evolved into the distribution of galaxies we see today is a challenge of modern cosmology [ref.]. An accurate reconstruction would allow us to test cosmological models by…
To understand the universe and to interpret the cosmological parameters governing its evolution it is necessary to contrast the data from galaxy surveys with simulation. Typically it entails using computationally expensive N -body…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…
Computer systems are so complex, so they are usually designed and analyzed in terms of layers of abstraction. Complexity is still a challenge facing logical reasoning tools that are used to find software design flaws and implementation…
The growth of large-scale cosmic structure is a beautiful exemplification of how complexity can emerge in our Universe, starting from simple initial conditions and simple physical laws. Using {\enzo} cosmological numerical simulations, I…
At the frontier of most areas in science, computer simulations play a central role. The traditional division of natural science into experimental and theoretical investigations is now completely outdated. Instead, theory, simulation, and…
In quantum cosmology, one applies quantum physics to the whole universe. While no unique version and no completely well-defined theory is available yet, the framework gives rise to interesting conceptual, mathematical and physical…
Complex systems throughout Nature display structures and functions that are built and maintained, at least in part, by optimal energies flowing through them--not specific, ideal values, rather ranges in energy rate density below which…
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable…
Software system certification presents itself with many challenges, including the necessity to certify the system at the level of functional requirements, code and binary levels, the need to chase down run-time errors, and the need for…
Applications of Riemannian quantum geometry to cosmology have had notable successes. In particular, the fundamental discreteness underlying quantum geometry has led to a natural resolution of the big bang singularity. However, the precise…
The expansion of our universe, when followed backward in time, implies that it emerged from a phase of huge density, the big bang. These stages are so extreme that classical general relativity combined with matter theories is not able to…
In engineering, it is a common desire to couple existing simulation tools together into one big system by passing information from subsystems as parameters into the subsystems under influence. As executed at fixed time points, this data…