The Energetic Costs of Cellular Computation (2012)
Summary
This paper theoretically computes the energetic costs of a simple cellular network computing ligand concentration, showing that breaking detailed balance and consuming energy is necessary for learning, with implications for resource-limited environments.
View Cached Full Text
Cached at: 07/12/26, 10:48 AM
# The Energetic Costs of Cellular Computation Source: [https://arxiv.org/abs/1203.5426](https://arxiv.org/abs/1203.5426) [View PDF](https://arxiv.org/pdf/1203.5426) > Abstract:Cells often perform computations in response to environmental cues\. A simple example is the classic problem, first considered by Berg and Purcell, of determining the concentration of a chemical ligand in the surrounding media\. On general theoretical grounds \(Landuer's Principle\), it is expected that such computations require cells to consume energy\. Here, we explicitly calculate the energetic costs of computing ligand concentration for a simple two\-component cellular network that implements a noisy version of the Berg\-Purcell strategy\. We show that learning about external concentrations necessitates the breaking of detailed balance and consumption of energy, with greater learning requiring more energy\. Our calculations suggest that the energetic costs of cellular computation may be an important constraint on networks designed to function in resource poor environments such as the spore germination networks of bacteria\. ## Submission history From: Pankaj Mehta \[[view email](https://arxiv.org/show-email/1a5c1110/1203.5426)\] **[\[v1\]](https://arxiv.org/abs/1203.5426v1)**Sat, 24 Mar 2012 15:52:10 UTC \(652 KB\) **[\[v2\]](https://arxiv.org/abs/1203.5426v2)**Wed, 4 Apr 2012 14:21:24 UTC \(652 KB\) **\[v3\]**Tue, 10 Apr 2012 16:26:01 UTC \(652 KB\)
Similar Articles
Can Agents Price a Reaction? Evaluating LLMs on Chemical Cost Reasoning
This paper introduces ChemCost, a benchmark for evaluating how well LLM agents can estimate chemical procurement costs by grounding identities, retrieving quotes, and handling noise. It reveals that current agents struggle with robustness and precise arithmetic reasoning in scientific workflows.
Cost Accounting for Reactive Computational Graphs: Exhaustive Sweeps, Sequential Mutation, and the Backward-Locality Gap
This paper presents a theoretical cost accounting for exhaustive sweeps and sequential mutations on reactive computational graphs, deriving speedup ratios and validating them on a Julia-based graph engine.
Literature Review: LLM Inference at the Edge: Mobile, NPU, and GPU Performance Efficiency Trade-offs Under Sustained Load | Bnechmarking LLMs on Phones [R]
This literature review analyzes performance efficiency trade-offs for LLM inference on mobile devices, NPUs, and GPUs under sustained load, focusing on benchmarking LLMs on phones.
Low Resource Computing 2026
The Low Resource Computing 2026 workshop challenges the trend of infinite growth in computing, advocating for resource-efficient computation inspired by historical achievements, aiming to put processing power back in individuals' hands for a sustainable future.
Are coding agents getting expensive, or are we measuring cost the wrong way?
The article questions whether the real cost of coding agents includes hidden human oversight and debugging, arguing that true value should be measured by trusted output rather than raw token consumption.