Related papers: Computation and Spacetime Structure
The payload performance of conventional computing systems, from single processors to supercomputers, reached its limits the nature enables. Both the growing demand to cope with "big data" (based on, or assisted by, artificial intelligence)…
The absolute/relative debate on the nature of space and time is ongoing for thousands of years. Here we attempt to investigate space and time from the information theoretic point of view to understand spatial and temporal correlations under…
There is a deep structural link between acausal spacetimes and quantum theory. As a consequence quantum theory may resolve some "paradoxes" of time travel. Conversely, non-time-orientable spacetimes naturally give rise to electric charges…
A logical model of spatiotemporal structures is pictured as a succession of processes in time. One usual way to formalize time structure is to assume the global existence of time points and then collect some of them to form time intervals…
We establish a version of the Momentum/Complexity (PC) duality between the rate of operator complexity growth and a radial component of bulk momentum for a test system falling into a black hole. In systems of finite entropy, our map remains…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
Cirquent calculus is a proof system with inherent ability to account for sharing subcomponents in logical expressions. Within its framework, this article constructs an axiomatization CL18 of the basic propositional fragment of computability…
By using techniques developed in quantum cosmology, it is found that a tunneling particle spends purely imaginary time on a barrier region. The {\it imaginary} time is associated with the stochastic acausal behaviour of a state, while the…
The Computing Continuum (CC) integrates different layers of processing infrastructure, from Edge to Cloud, to optimize service quality through ubiquitous and reliable computation. Compared to central architectures, however, heterogeneous…
We analyze spacetimes with horizons and study the thermodynamic aspects of causal horizons, suggesting that the resemblance between gravitational and thermodynamic systems has a deeper quantum mechanical origin. We find that the observer…
Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that…
Conformal prediction (CP) provides a comprehensive framework to produce statistically rigorous uncertainty sets for black-box machine learning models. To further improve the efficiency of CP, conformal correction is proposed to fine-tune or…
We consider notions of space complexity for Infinite Time Turing Machines (ITTMs) that were introduced by B. L\"owe and studied further by J. Winter. We answer several open questions about these notions, among them whether low space…
This is the first part in a series of two papers, where we consider a specific microscopic model of spacetime. In our model Planck size quantum black holes are taken to be the fundamental building blocks of space and time. Spacetime is…
This paper is an attempt to incorporate the idea of spiking neural P systems as an early seed into the area of Operating System Design, regarding their capability to solve some classical computer science problems. It is reflecting the power…
We analyze the relation between CP-divisibility and the lack of information backflow for an arbitrary -- not necessarily invertible -- dynamical map. It is well known that CP-divisibility always implies lack of information backflow.…
We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…
In topological quantum computing, information is encoded in "knotted" quantum states of topological phases of matter, thus being locked into topology to prevent decay. Topological precision has been confirmed in quantum Hall liquids by…
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…