Related papers: Complexity vs Energy: Theory of Computation and Th…
The previously proposed Heisenberg-type relation $ E_c t_c >> \hbar {\cal C}$ for the energy used by a quantum computer, the total computation time and the logical ("classical") complexity of the problem is verified for the following…
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may "compute the hard or even the…
Energy is a complex idea that cuts across scientific disciplines. For life science students, an approach to energy that incorporates chemical bonds and chemical reactions is better equipped to meet the needs of life sciences students than a…
Understanding the reason for the observed accelerated expansion of the Universe represents one of the fundamental open questions in physics. In cosmology, a classification has emerged among physical models for the acceleration,…
Philosophy of science attempts to describe all parts of the scientific process in a general way in order to facilitate the description, execution and improvements of this process. So far, all proposed philosophies have only covered existing…
Several examples are used to illustrate how we deal cavalierly with infinities and unphysical systems in physics. Upon examining these examples in the context of infinities from Cantor's theory of transfinite numbers, the only known…
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We…
In this paper, it is argued that theoretical physics is more akin to an organism than to a rigid structure.It is in this sense that the epithet, "sick", applies to it. It is argued that classical physics is a model of a healthy science, and…
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth rates) There exist bosonic gate sets which increase energy…
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the \emph{computation environment}. A computation environment consists of two main parts: i) a…
The theory that all processes in the universe are computational is attractive in its promise to provide an understandable theory of everything. I want to suggest here that this pancomputationalism is not sufficiently clear on which problem…
Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis. We draw a clear line as to…
For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures…
The Lorentz lattice gas is studied from the perspective of computational complexity theory. It is shown that using massive parallelism, particle trajectories can be simulated in a time that scales logarithmically in the length of the…
One of the major resource requirements of computers - ranging from biological cells to human brains to high-performance (engineered) computers - is the energy used to run them. Those costs of performing a computation have long been a focus…
It is currently believed that light quantum or the quantization of light energy is beyond classical physics and the picture of wave-particle duality, which was criticized by Einstein but attracted a number of experimental researches, is…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
Advantages of quantum effects in several technologies, such as computation and communication, have already been well appreciated, and some devices, such as quantum computers and communication links, exhibiting superiority to their classical…
We discuss views about whether the universe can be rationally comprehended, starting with Plato, then Leibniz, and then the views of some distinguished scientists of the previous century. Based on this, we defend the thesis that…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…