Draft:Brownian Computation
This article, Draft:Brownian Computation, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Preload talk Inform author |
This article, Draft:Brownian Computation, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Preload talk Inform author |
This article, Draft:Brownian Computation, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Preload talk Inform author |
- File:Symbol opinion vote.svg 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)
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
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 | edit source]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 | edit source]All Brownian computers are based on fundamental principles aimed at minimizing or mitigating entropy production :
- They operate via thermal fluctuations—Brownian motion (in order to "do work")
- They do not contain springs or sources of friction, as these would dissipate thermal energy (heat) (and defeat the purpose).
- They attempt to be thermodynamically reversible by relying solely on logically reversible operations (e.g., Not, Controlled Not, etc.).
The framework's high level of abstraction and simplicity allows for a wide variety of different "types" of Brownian computers. [3]
References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).