Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a264ea5a5dbccdd8

Jump to content

Draft:Brownian Computation

From Wikipedia, the free encyclopedia
  • Comment: I think you have probably written what you wish to say about the subject, and then sought references after writing in order to cite what you say. This is WP:BACKWARDS. Instead, please read this essay, one of several which outline a process which will succeed assuming the subject to be notable. If it isn't notable then no amount of editing can help. We use the references in the process described in the essay to determine and verify notability. No suitable references means the subject is not notable, and it is time to stop. 🇵🇸🇺🇦 FiddleTimtrent FaddleTalk to me 🇺🇦🇵🇸 12:01, 27 December 2025 (UTC)
  • Comment: This is an essay with a random collection of information on the topic. The recent addition of the section on the Feynman lectures is irrelevant. I strongly suggest to the author that they do some simple editing and reading of existing articles to first learn what encyclopedic articles are on Wikipedia. Ldm1954 (talk) 12:54, 16 December 2025 (UTC)


Brownian computers (or automata) are a form of theoretical computing devices. They are thought experiments rather than practical machines, but are still based on, and derived from, physical laws. Their behavior is closely tied to principles involving entropy and Brownian motion. They relate to several fields and branches, including (computational) thermodynamics, information theory, and Hamiltonian dynamics. With some ideas potentially extending into philosophy. [1]

In theory, they have been proposed as a type of thermodynamically reversible computer, which would exempt them from Landauer’s principle; however, this remains under significant academic debate, with critics arguing that they are in actuality thermodynamically irreversible.[2]

History

[edit]

Brownian computers were first proposed as a solution to "Maxwell's daemon" by Charles H. Bennett (alongside contributions from Rolf Landauer). They were inspired by nature, and biological processes - namely DNA and RNA interactions (Nucleic Acid Interactions). The idea was developed in the context of IBM research and academic discussions in the fields relating to thermodynamics and theoretical computer science. Dr Bennett explored these ideas in the 1970s and 1980s, with key publications including Bennett’s 1973 paper “Logical Reversibility of Computation”[3]

Theoretical Framework

[edit]

All Brownian computers are based on fundamental principles aimed at minimizing or mitigating entropy production :

The framework's high level of abstraction and simplicity allows for a wide variety of different "types" of Brownian computers. [3]

References

[edit]
  1. Bennett, C. H. (1982). "The thermodynamics of computation—a review". International Journal of Theoretical Physics. 21: 905–940. doi:10.1007/BF02084158.
  2. Norton, John (2013). "Brownian Computation is Thermodynamically Irreversible" (PDF). Foundations of Physics. 43 (11). Bibcode:2013FoPh...43.1384N. doi:10.1007/s10701-013-9753-1.
  3. 1 2 Bennett, C. H. (November 1973). "Logical Reversibility of Computation". IBM Journal of Research and Development. 17 (6): 525–532. doi:10.1147/rd.176.0525.