Editing A cost/speed/reliability tradeoff to erasing
From Thermodynamics of Computation
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 11: | Line 11: | ||
|doi=10.1007/978-3-319-21819-9_14 | |doi=10.1007/978-3-319-21819-9_14 | ||
|isbn=9783319218182 | |isbn=9783319218182 | ||
| − | |||
|scopus=2-s2.0-84943625259 | |scopus=2-s2.0-84943625259 | ||
|pui=606383559 | |pui=606383559 | ||
| − | |abstract=We present a KL-control treatment of the fundamental problem of erasing a bit. We introduce notions of "reliability" of information storage via a reliability timescale | + | |abstract=We present a KL-control treatment of the fundamental problem of erasing a bit. We introduce notions of "reliability" of information storage via a reliability timescale $\tau_r$, and "speed" of erasing via an erasing timescale $\tau_e$. Our problem formulation captures the tradeoff between speed, reliability, and the Kullback-Leibler (KL) cost required to erase a bit. We show that rapid erasing of a reliable bit costs at least $\log 2 - \log\left(1 - \operatorname{e}^{-\frac{\tau_e}{\tau_r}}\right) > \log 2$, which goes to $\frac{1}{2} \log\frac{2\tau_r}{\tau_e}$ when $\tau_r>>\tau_e$. |
|Mendeley link=http://www.mendeley.com/research/costspeedreliability-tradeoff-erasing | |Mendeley link=http://www.mendeley.com/research/costspeedreliability-tradeoff-erasing | ||
|pages=192-201 | |pages=192-201 | ||
