A Cost/Speed/Reliability Tradeoff to Erasing†
School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400005, India
This paper is an extended version of our paper published in the 14th International Conference on Unconventional Computation and Natural Computation (UCNC), Auckland, New Zealand, 30 August–3 September 2015
Academic Editors: John Baez, John Harte, Marc Harper and Adom Giffin
Received: 21 December 2015 / Revised: 21 March 2016 / Accepted: 22 April 2016 / Published: 28 April 2016
We present a Kullback–Leibler (KL) control treatment of the fundamental problem of erasing a bit. We introduce notions of reliability of information storage via a reliability timescale
, and speed of erasing via an erasing timescale
. Our problem formulation captures the tradeoff between speed, reliability, and the KL cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least
, which goes to
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Gopalkrishnan, M. A Cost/Speed/Reliability Tradeoff to Erasing. Entropy 2016, 18, 165.
Gopalkrishnan M. A Cost/Speed/Reliability Tradeoff to Erasing. Entropy. 2016; 18(5):165.
Gopalkrishnan, Manoj. 2016. "A Cost/Speed/Reliability Tradeoff to Erasing." Entropy 18, no. 5: 165.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.