Read-once machines and the thermodynamic complexity of Maxwell's demons

04/22/2023
by   Fırat Kıyak, et al.
0

The thermodynamical costs imposed by computational resource limitations like memory and time have been investigated before. We focus on a new computational limitation, namely, the machine being allowed to scan the input only once, and prove that it is associated with unavoidable thermodynamical cost, even in the presence of infinite time and memory resources. We identify this limitation to be the one suffered by Maxwell's demons. This provides a framework for quantifying the complexity associated with an experiment that effectuates a "decrease" in the entropy of a thermodynamic system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

From Multimodal to Unimodal Webpages for Developing Countries

The multimodal web elements such as text and images are associated with ...
research
02/08/2023

On the Computational Complexity of Ethics: Moral Tractability for Minds and Machines

Why should moral philosophers, moral psychologists, and machine ethicist...
research
04/06/2020

A limitation on the KPT interpolation

We prove a limitation on a variant of the KPT theorem proposed for propo...
research
05/02/2019

Space-bounded Church-Turing thesis and computational tractability of closed systems

We report a new limitation on the ability of physical systems to perform...
research
08/22/2023

Demand-driven provisioning of Kubernetes-like resources in OSG

The OSG-operated Open Science Pool is an HTCondor-based virtual cluster ...
research
12/04/2021

Resource Theories as Quantale Modules

We aim to counter the tendency for specialization in science by advancin...
research
10/04/2022

Memory in humans and deep language models: Linking hypotheses for model augmentation

The computational complexity of the self-attention mechanism in Transfor...

Please sign up or login with your details

Forgot password? Click here to reset