Related papers: Daemon computers versus clairvoyant computers: A p…
Fog computing allows computationally-heavy problems with tight time constraints to be solved even if end devices have limited computational resources and latency induced by cloud computing is too high. How can energy consumed by fog…
Small, out-of-equilibrium, and quantum systems defy simple thermodynamic expressions. Such systems are exemplified by molecular switches, which exchange heat with a bath. These molecules can photoisomerize, or change conformation, or…
Energy has no definition, except that given by a conservation principle which essentially amounts to defining it as the elements of an open list of unknown cardinality. Entropy, identified by Shannon as information we lack, has too many…
We propose a duality between thermodynamics and computational complexity, elevating the difficulty of a computational task to the status of a thermodynamic variable. By introducing a complexity measure C as a novel coordinate, we formulate…
The problem of emergence in physical theories makes necessary to build a general theory of the relationships between the observed system and the observing system. It can be shown that there exists a correspondence between classical systems…
In the present paper, several issues concerning the second law of thermodynamics, Maxwell's demon and Landauer's principle are dealt with. I argue that if the demon and the system on which it operates without dissipation of external energy…
While several paths have emerged in microelectronics and computing as follow-ons to Turing architectures, and have been implemented using essentially silicon circuits, very little beyond Moore research has considered: (1) first biological…
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…
According to the Church-Turing Thesis (CTT), effective formal behaviours can be simulated by Turing machines; this has naturally led to speculation that physical systems can also be simulated computationally. But is this wider claim true,…
Developing a thermodynamic theory of computation is a challenging task at the interface of non-equilibrium thermodynamics and computer science. In particular, this task requires dealing with difficulties such as stochastic halting times,…
A myriad of applications ranging from engineering and scientific simulations, image and signal processing as well as high-sensitive data retrieval demand high processing power reaching up to teraflops for their efficient execution. While a…
Maxwellian ratchets are autonomous, finite-state thermodynamic engines that implement input-output informational transformations. Previous studies of these "demons" focused on how they exploit environmental resources to generate work: They…
This paper is a survey dedicated to the analogy between the notions of {\it complexity} in theoretical computer science and {\it energy} in physics. This analogy is not metaphorical: I describe three precise mathematical contexts, suggested…
Measurements --- interactions which establish correlations between a system and a recording device --- can be made thermodynamically reversible. One might be concerned that such reversibility will make the second law of thermodynamics…
A communication theory for a transmitter broadcasting to many receivers is presented. In this case energetic considerations cannot be neglected as in Shannon theory. It is shown that, when energy is assigned to the information bit,…
The third law of thermodynamics, also known as the Nernst unattainability principle, puts a fundamental bound on how close a system, whether classical or quantum, can be cooled to a temperature near to absolute zero. On the other hand, a…
We review theory of information thermodynamics which incorporates effects of measurement and feedback into nonequilibrium thermodynamics of a small system, and discuss how the second law of thermodynamics should be extended for such…
Erasing memory is a fundamental operational task in quantum information processing, governed by Landauer's principle, which links information loss to thermodynamic work. We introduce and analyze assisted quantum erasure, where correlations…
The minimum heat cost of computation is subject to bounds arising from Landauer's principle. Here, I derive bounds on finite modelling -- the production or anticipation of patterns (time-series data) -- by devices that model the pattern in…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…