Draft:Brownian Computation
| Review waiting, please be patient.
This may take 2–3 weeks or more, since drafts are reviewed in no specific order. There are 438 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
| Submission declined on 16 December 2025 by Ldm1954 (talk). This submission does not appear to be written in the formal tone expected of an encyclopedia article. Entries should be written from a neutral point of view, and should refer to a range of independent, reliable, published sources. Please rewrite your submission in a more encyclopedic format. Please make sure to avoid peacock terms that promote the subject.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
This draft has been resubmitted and is currently awaiting re-review. |
| Submission declined on 11 December 2025 by Pythoncoder (talk). This submission is not adequately supported by reliable sources. Reliable sources are required so that information can be verified. If you need help with referencing, please see Referencing for beginners and Citing sources. Declined by Pythoncoder 14 days ago. |
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]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 :
- 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]- ^ Bennett, C. H. (1982). "The thermodynamics of computation—a review". International Journal of Theoretical Physics. 21: 905–940. doi:10.1007/BF02084158.
- ^ 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.
- ^ a b 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.

