Santa Fe Institute Collaboration Platform

Thermodynamics of Computation

Search by property

From Thermodynamics of Computation

This page provides a simple browsing interface for finding entities described by a property and a named value. Other available search interfaces include the page property search, and the ask query builder.

Search by property

A list of all pages that have property "Abstract" with value "We present a Kullback-Leibler (KL) control treatment of the fundamental problem of erasing a bit. We introduce notions of '"`UNIQ--math-00000CE1-QINU`"' of information storage via a reliability timescale '"`UNIQ--math-00000CE2-QINU`"', and speed of erasing via an erasing timescale '"`UNIQ--math-00000CE3-QINU`"'. 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 '"`UNIQ--math-00000CE4-QINU`"', which goes to '"`UNIQ--math-00000CE5-QINU`"' when '"`UNIQ--math-00000CE6-QINU`"'.". Since there have been only a few results, also nearby values are displayed.

Showing below up to 2 results starting with #1.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)


    

List of results

    • A Cost / Speed / Reliability Trade-off in Erasing a Bit  + (We present a Kullback-Leibler (KL) controlWe present a Kullback-Leibler (KL) control treatment of the fundamental problem of erasing a bit. We introduce notions of '"`UNIQ--math-00000CE1-QINU`"' of information storage via a reliability timescale '"`UNIQ--math-00000CE2-QINU`"', and speed of erasing via an erasing timescale '"`UNIQ--math-00000CE3-QINU`"'. 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 '"`UNIQ--math-00000CE4-QINU`"', which goes to '"`UNIQ--math-00000CE5-QINU`"' when '"`UNIQ--math-00000CE6-QINU`"'.NU`"' when '"`UNIQ--math-00000CE6-QINU`"'.)