TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Reversible computing escapes the lab

277 pointsby jasondavies4 months ago

19 comments

colanderman4 months ago
Nice, these ideas have been around for a long time but never commercialized to my knowledge. I&#x27;ve done some experiments in this area with simulations and am currently designing some test circuitry to be fabbed via Tiny Tapeout.<p>Reversibility isn&#x27;t actually necessary for most of the energy savings. It saves you an extra maybe 20% beyond what adiabatic techniques can do on their own. Reason being, the energy of the information itself pales in comparison to the resistive losses which dominate the losses in adiabatic circuits, and it&#x27;s actually a (device-dependent) portion of these resistive losses which the reversible aspect helps to recover, not the energy of information itself.<p>I&#x27;m curious why Frank chose to go with a resonance-based power-clock, instead of a switched-capacitor design. In my experience the latter are nearly as efficient (losses are still dominated by resistive losses in the powered circuit itself), and are more flexible as they don&#x27;t need to be tuned to the resonance of the device. (Not to mention they don&#x27;t need an inductor.) My guess would be that, despite requiring an on-die inductor, the overall chip area required is much less than that of a switched-capacitor design. (You only need one circuit&#x27;s worth of capacitance, vs. 3 or more for a switched design, which quadruples your die size....)<p>I&#x27;m actually somewhat skeptical of the 4000x claim though. Adiabatic circuits can typically only provide about a single order of magnitude power savings over traditional CMOS -- they still have resistive losses, they just follow a slightly different equation (f²RC²V², vs. fCV²). But RC and C are figures of merit for a given silicon process, and fRC (a dimensionless figure) is constrained by the operational principles of digital logic to the order of 0.1, which in turn constrains the power savings to that order of magnitude regardless of process. Where you can find excess savings though is simply by reducing operating frequency. Adiabatic circuits benefit more from this than traditional CMOS. Which is great if you&#x27;re building something like a GPU which can trade clock frequency for core count.
评论 #42702555 未加载
评论 #42698567 未加载
评论 #42699942 未加载
PaulHoule4 months ago
Notably the physical limit is<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Landauer%27s_principle" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Landauer%27s_principle</a><p>it doesn&#x27;t necessarily take any energy at all to process information, but it does take roughly kT work of energy to <i>erase</i> a bit of information. It&#x27;s related to<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Maxwell%27s_demon" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Maxwell%27s_demon</a><p>as, to complete cycles, the demon has to clear its memory.
评论 #42702748 未加载
entaloneralie4 months ago
Henry G. Baker wrote this paper titled &quot;The Thermodynamics of Garbage Collection&quot; in the 90s about linear logic, stack machines, reversibility and the cost of erasing information:<p><a href="https:&#x2F;&#x2F;wiki.xxiivv.com&#x2F;docs&#x2F;baker_thermodynamics.html" rel="nofollow">https:&#x2F;&#x2F;wiki.xxiivv.com&#x2F;docs&#x2F;baker_thermodynamics.html</a><p>A subset of FRACTRAN programs are reversible, and I would love to see rewriting computers as a potential avenue for reversible circuit building(similar to the STARAN cpu):<p><a href="https:&#x2F;&#x2F;wiki.xxiivv.com&#x2F;site&#x2F;fractran.html#reversibility" rel="nofollow">https:&#x2F;&#x2F;wiki.xxiivv.com&#x2F;site&#x2F;fractran.html#reversibility</a>
siver_john4 months ago
This is really cool, I never expected to see reversible computation made in electrical systems. I learned about it undergrad taking a course by Bruce MacLennan* though it was more applied to &quot;billiard ball&quot; or quantum computing. It was such a cool class though.<p>*Seems like he finally published the text book he was working on when teaching the class: [<a href="https:&#x2F;&#x2F;www.amazon.com&#x2F;dp&#x2F;B0BYR86GP7?ref_=pe_3052080_397514860][https:&#x2F;&#x2F;www.amazon.com&#x2F;dp&#x2F;B0BYR86GP7?ref_=pe_3052080_397514860]" rel="nofollow">https:&#x2F;&#x2F;www.amazon.com&#x2F;dp&#x2F;B0BYR86GP7?ref_=pe_3052080_3975148...</a>
Jean-Papoulos4 months ago
&gt;it is producing a chip that, for the first time, recovers energy used in an arithmetic circuit. The next chip, projected to hit the market in 2027, will be an energy-saving processor specialized for AI inference. The 4,000x energy-efficiency improvement is on Vaire’s road map but probably 10 or 15 years out.<p>How I wish I could place bets on this never happening.<p>&gt;In the following years, Vaire plans to design the first reversible chip specialized for AI inference.<p>These guys are cashing in on AI hype. Watch them raise VC money, give themselves 6 figures salaries and file for bankruptcy in 3 years.
评论 #42709785 未加载
评论 #42710085 未加载
pama4 months ago
The ideas are neat and both Landauer and Bennet did some great work and left a powerful legacy. The energetic limits we are talking about are not yet relevant in modern computers. The amount of excess thermal energy for performing 10^26 erasures associated to some computation (of say an LLM that would be too powerful for the current presidential orders) would only be about 0.1kWh, so 10 minutes of a single modern GPU. There are other advantages to reversibility, of course, and maybe one day even that tiny amount of energy savings will matter.
stevage4 months ago
Wow. This whole logic sounds like something really harebrained from a Dr Who episode: &quot;It takes energy to destroy information. Therefore if you don&#x27;t destroy information, it doesn&#x27;t take energy!&quot; - sounds completely illogical.<p>I honestly don&#x27;t understand from the article how you &quot;recover energy&quot;. Yet I have no reason to disbelieve it.
评论 #42705635 未加载
评论 #42710869 未加载
leoc4 months ago
Also an Edward Fredkin <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Edward_Fredkin" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Edward_Fredkin</a> interest <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Fredkin_gate" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Fredkin_gate</a> .
评论 #42701412 未加载
lkm04 months ago
All of quantum computing is reversible by nature (until you measure the state, of course). Yet, there&#x27;some research in the field focusing on irreversible (&quot;non-unitary&quot;) quantum algorithms and it appears there is some advantage in throwing away, algorithmically speaking, the reversibility. See <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2309.16596" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2309.16596</a><p>It&#x27;s interesting that classical and quantum computing researchers are each looking in the direction of the other field.
amelius4 months ago
&gt; The main way to reduce unnecessary heat generation in transistor use—to operate them adiabatically—is to ramp the control voltage slowly instead of jumping it up or down abruptly.<p>But if you change the gate voltage slowly, then the transistor will be for a longer period in the resistive region where it dissipates energy. Shouldn&#x27;t you go between the OFF and ON states as quickly as possible?
评论 #42704626 未加载
EncomLab4 months ago
Calling the addition of an energy storage device into a transistor &quot;reverse computing&quot; is like calling a hybrid car using regenerative braking &quot;reverse driving&quot;.<p>It&#x27;s a very interesting concept - best discussed over pints at the pub on a Sunday afternoon along with over unity devices and the sad lack of adoption of bubble memory.
评论 #42698446 未加载
评论 #42698106 未加载
评论 #42699911 未加载
评论 #42698028 未加载
IgorPartola4 months ago
This is probably a dumb question, but where does this fail: what happens if I run something like the SHA256 algorithm or a sudoku solver backwards using these techniques? I assume that wouldn’t actually work, but why?
评论 #42710963 未加载
DonHopkins4 months ago
Reversible Computing (2016) [video] (youtube.com)<p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=16007128">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=16007128</a><p><a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=rVmZTGeIwnc" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=rVmZTGeIwnc</a><p>DonHopkins on Dec 26, 2017 | next [–]<p>Billiard Ball cellular automata, proposed and studied by Edward Fredkin and Tommaso Toffoli, are one interesting type of reversible computer. The Ising spin model of ferromagnetism is another reversible cellular automata technique. <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Billiard-ball_computer" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Billiard-ball_computer</a><p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Reversible_cellular_automaton" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Reversible_cellular_automaton</a><p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Ising_model" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Ising_model</a><p>If billiard balls aren&#x27;t creepy enough for you, live soldier crabs of the species Mictyris guinotae can be used in place of the billiard balls.<p><a href="https:&#x2F;&#x2F;www.newscientist.com&#x2F;blogs&#x2F;onepercent&#x2F;2012&#x2F;04&#x2F;researchers-build-crab-powered.html" rel="nofollow">https:&#x2F;&#x2F;www.newscientist.com&#x2F;blogs&#x2F;onepercent&#x2F;2012&#x2F;04&#x2F;resear...</a><p><a href="https:&#x2F;&#x2F;www.wired.com&#x2F;2012&#x2F;04&#x2F;soldier-crabs&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.wired.com&#x2F;2012&#x2F;04&#x2F;soldier-crabs&#x2F;</a><p><a href="http:&#x2F;&#x2F;www.complex-systems.com&#x2F;abstracts&#x2F;v20_i02_a02.html" rel="nofollow">http:&#x2F;&#x2F;www.complex-systems.com&#x2F;abstracts&#x2F;v20_i02_a02.html</a><p>Robust Soldier Crab Ball Gate<p>Yukio-Pegio Gunji, Yuta Nishiyama. Department of Earth and Planetary Sciences, Kobe University, Kobe 657-8501, Japan.<p>Andrew Adamatzky. Unconventional Computing Centre. University of the West of England, Bristol, United Kingdom.<p>Abstract<p>Soldier crabs Mictyris guinotae exhibit pronounced swarming behavior. Swarms of the crabs are tolerant of perturbations. In computer models and laboratory experiments we demonstrate that swarms of soldier crabs can implement logical gates when placed in a geometrically constrained environment.
EncomLab4 months ago
The miniscule amount of energy retained from the &quot;reverse computation&quot; will be absolutely demolished by the first DRAM refresh.
评论 #42702525 未加载
yalogin4 months ago
The concept completely flummoxed me but how does this play with quantum computers? That’s the direction we are going aren’t we?
评论 #42703209 未加载
jheriko4 months ago
interesting.<p>on a basic level, with the gates, it seems, if you have at most two input amounts of work, and get at most one out, then storing the lost work for later reuse makes sense
DonHopkins4 months ago
<a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=35366971">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=35366971</a><p>Tipler&#x27;s Omega Point cosmology:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Frank_J._Tipler#The_Omega_Point" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Frank_J._Tipler#The_Omega_Poin...</a><p>&gt;The Omega Point cosmology<p>&gt;The Omega Point is a term Tipler uses to describe a cosmological state in the distant proper-time future of the universe.[6] He claims that this point is required to exist due to the laws of physics. According to him, it is required, for the known laws of physics to be consistent, that intelligent life take over all matter in the universe and eventually force its collapse. During that collapse, the computational capacity of the universe diverges to infinity, and environments emulated with that computational capacity last for an infinite duration as the universe attains a cosmological singularity. This singularity is Tipler&#x27;s Omega Point.[7] With computational resources diverging to infinity, Tipler states that a society in the far future would be able to resurrect the dead by emulating alternative universes.[8] Tipler identifies the Omega Point with God, since, in his view, the Omega Point has all the properties of God claimed by most traditional religions.[8][9]<p>&gt;Tipler&#x27;s argument of the omega point being required by the laws of physics is a more recent development that arose after the publication of his 1994 book The Physics of Immortality. In that book (and in papers he had published up to that time), Tipler had offered the Omega Point cosmology as a hypothesis, while still claiming to confine the analysis to the known laws of physics.[10]<p>&gt;Tipler, along with co-author physicist John D. Barrow, defined the &quot;final anthropic principle&quot; (FAP) in their 1986 book The Anthropic Cosmological Principle as a generalization of the anthropic principle:<p>&gt;Intelligent information-processing must come into existence in the Universe, and, once it comes into existence, will never die out.[11]<p>&gt;One paraphrasing of Tipler&#x27;s argument for FAP runs as follows: For the universe to physically exist, it must contain living observers. Our universe obviously exists. There must be an &quot;Omega Point&quot; that sustains life forever.[12]<p>&gt;Tipler purportedly used Dyson&#x27;s eternal intelligence hypothesis to back up his arguments.<p>Cellular Automata Machines: A New Environment for Modeling:<p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=30735397">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=30735397</a><p>&gt;It&#x27;s also very useful for understanding other massively distributed locally interacting parallel systems, epidemiology, economics, morphogenesis (reaction-diffusion systems, like how a fertilized egg divides and specializes into an organism), GPU programming and optimization, neural networks and machine learning, information and chaos theory, and physics itself.<p>&gt;I&#x27;ve discussed the book and the code I wrote based on it with Norm Margolus, one of the authors, and he mentioned that he really likes rules that are based on simulating physics, and also thinks reversible cellular automata rules are extremely important (and energy efficient in a big way, in how they relate to physics and thermodynamics).<p>&gt;The book has interesting sections about physical simulations like spin glasses (Ising Spin model of the magnetic state of atoms of solid matter), and reversible billiard ball simulations (like deterministic reversible &quot;smoke and mirrors&quot; with clouds of moving particles bouncing off of pinball bumpers and each other).<p>Spin Glass:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Spin_glass" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Spin_glass</a><p>&gt;In condensed matter physics, a spin glass is a magnetic state characterized by randomness, besides cooperative behavior in freezing of spins at a temperature called &#x27;freezing temperature&#x27; Tf. Magnetic spins are, roughly speaking, the orientation of the north and south magnetic poles in three-dimensional space. In ferromagnetic solids, component atoms&#x27; magnetic spins all align in the same direction. Spin glass when contrasted with a ferromagnet is defined as &quot;disordered&quot; magnetic state in which spins are aligned randomly or not with a regular pattern and the couplings too are random.<p>Billiard Ball Computer:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Billiard-ball_computer" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Billiard-ball_computer</a><p>&gt;A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli. Instead of using electronic signals like a conventional computer, it relies on the motion of spherical billiard balls in a friction-free environment made of buffers against which the balls bounce perfectly. It was devised to investigate the relation between computation and reversible processes in physics.<p>Reversible Cellular Automata:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Reversible_cellular_automaton" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Reversible_cellular_automaton</a><p>&gt;A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells, each containing a state drawn from a finite set of states, with a rule for updating all cells simultaneously based on the states of their neighbors, such that the previous state of any cell before an update can be determined uniquely from the updated states of all the cells. The time-reversed dynamics of a reversible cellular automaton can always be described by another cellular automaton rule, possibly on a much larger neighborhood.<p>&gt;[...] Reversible cellular automata form a natural model of reversible computing, a technology that could lead to ultra-low-power computing devices. Quantum cellular automata, one way of performing computations using the principles of quantum mechanics, are often required to be reversible. Additionally, many problems in physical modeling, such as the motion of particles in an ideal gas or the Ising model of alignment of magnetic charges, are naturally reversible and can be simulated by reversible cellular automata.<p>Theory of Self-Reproducing Automata: John von Neumann&#x27;s Quantum Mechanical Universal Constructors:<p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22738268">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22738268</a><p>[...] Third, the probabilistic quantum mechanical kind, which could mutate and model evolutionary processes, and rip holes in the space-time continuum, which he unfortunately (or fortunately, the the sake of humanity) didn&#x27;t have time to fully explore before his tragic death.<p>&gt;p. 99 of &quot;Theory of Self-Reproducing Automata&quot;:<p>&gt;Von Neumann had been interested in the applications of probability theory throughout his career; his work on the foundations of quantum mechanics and his theory of games are examples. When he became interested in automata, it was natural for him to apply probability theory here also. The Third Lecture of Part I of the present work is devoted to this subject. His &quot;Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components&quot; is the first work on probabilistic automata, that is, automata in which the transitions between states are probabilistic rather than deterministic. Whenever he discussed self-reproduction, he mentioned mutations, which are random changes of elements (cf. p. 86 above and Sec. 1.7.4.2 below). In Section 1.1.2.1 above and Section 1.8 below he posed the problems of modeling evolutionary processes in the framework of automata theory, of quantizing natural selection, and of explaining how highly efficient, complex, powerful automata can evolve from inefficient, simple, weak automata. A complete solution to these problems would give us a probabilistic model of self-reproduction and evolution. [9]<p>[9] For some related work, see J. H. Holland, &quot;Outline for a Logical Theory of Adaptive Systems&quot;, and &quot;Concerning Efficient Adaptive Systems&quot;.<p><a href="https:&#x2F;&#x2F;www.deepdyve.com&#x2F;lp&#x2F;association-for-computing-machinery&#x2F;outline-for-a-logical-theory-of-adaptive-systems-efsWyqMa1l" rel="nofollow">https:&#x2F;&#x2F;www.deepdyve.com&#x2F;lp&#x2F;association-for-computing-machin...</a><p><a href="https:&#x2F;&#x2F;deepblue.lib.umich.edu&#x2F;bitstream&#x2F;handle&#x2F;2027.42&#x2F;5578&#x2F;bac4296.0001.001.pdf?sequence=5" rel="nofollow">https:&#x2F;&#x2F;deepblue.lib.umich.edu&#x2F;bitstream&#x2F;handle&#x2F;2027.42&#x2F;5578...</a><p><a href="https:&#x2F;&#x2F;www.worldscientific.com&#x2F;worldscibooks&#x2F;10.1142&#x2F;10841" rel="nofollow">https:&#x2F;&#x2F;www.worldscientific.com&#x2F;worldscibooks&#x2F;10.1142&#x2F;10841</a><p>perl4ever on Dec 26, 2017 | root | parent | next [–]<p>Tipler&#x27;s Omega Point prediction doesn&#x27;t seem like it would be compatible with the expanding universe, would it? Eventually everything will disappear over the speed-of-light horizon, and then it can&#x27;t be integrated into one mind.<p>DonHopkins on Dec 26, 2017 | root | parent | next [–]<p>It also wishfully assumes that the one mind can&#x27;t think of better things to do with its infinite amount of cloud computing power than to simulate one particular stone age mythology.<p>Then again, maybe it&#x27;s something like the 1996 LucasArts game Afterlife, where you simulate every different religion&#x27;s version of heaven and hell at once.<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Afterlife_(video_game)" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Afterlife_(video_game)</a><p>The primary goal of the game is to provide divine and infernal services for the inhabitants of the afterlife. This afterlife caters to one particular planet, known simply as the Planet. The creatures living on the Planet are called EMBOs, or Ethically Mature Biological Organisms. When an EMBO dies, its soul travels to the afterlife where it attempts to find an appropriate &quot;fate structure&quot;. Fate structures are places where souls are rewarded or punished, as appropriate, for the virtues or sins that they practiced while they were alive.
DonHopkins4 months ago
<a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=30735397">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=30735397</a><p>DonHopkins on March 19, 2022 | parent | context | favorite | on: Ask HN: What book changed your life?<p>Cellular Automata Machines: A New Environment for Modeling Published April 1987 by MIT Press. ISBN: 9780262200608.<p><a href="http:&#x2F;&#x2F;mitpress.mit.edu&#x2F;books&#x2F;cellular-automata-machines" rel="nofollow">http:&#x2F;&#x2F;mitpress.mit.edu&#x2F;books&#x2F;cellular-automata-machines</a><p><a href="http:&#x2F;&#x2F;www.researchgate.net&#x2F;publication&#x2F;44522568_Cellular_automata_machines__a_new_environment_for_modeling__Tommaso_Toffoli_Norman_Margolus" rel="nofollow">http:&#x2F;&#x2F;www.researchgate.net&#x2F;publication&#x2F;44522568_Cellular_au...</a><p><a href="https:&#x2F;&#x2F;donhopkins.com&#x2F;home&#x2F;cam-book.pdf" rel="nofollow">https:&#x2F;&#x2F;donhopkins.com&#x2F;home&#x2F;cam-book.pdf</a><p><a href="https:&#x2F;&#x2F;github.com&#x2F;SimHacker&#x2F;CAM6&#x2F;blob&#x2F;master&#x2F;javascript&#x2F;CAM6.js#L41">https:&#x2F;&#x2F;github.com&#x2F;SimHacker&#x2F;CAM6&#x2F;blob&#x2F;master&#x2F;javascript&#x2F;CAM...</a><p>themodelplumber on March 20, 2022 | prev [–]<p>I&#x27;m curious, how did the book change your life? What kind of problems did the authors model using their approach? I&#x27;m new to the topic, thanks for any input.<p>DonHopkins on March 22, 2022 | parent [–]<p>It really helped me get my head around how to understand and program cellular automata rules, which is a kind of massively parallel distributed &quot;Think Globally, Act Locally&quot; approach that also applies to so many other aspects of life.<p>But by &quot;life&quot; I don&#x27;t mean just the cellular automata rule &quot;life&quot;! Not to be all depressing like Marvin the Paranoid Android, but I happen to think &quot;life&quot; is overrated. ;) There are so many billions of other extremely interesting cellular automata rules besides &quot;life&quot; too, so don&#x27;t stop once you get bored with life! ;)<p><a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=CAA67a2-Klk" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=CAA67a2-Klk</a><p>For example, it&#x27;s kind of like how the world wide web works: &quot;Link Globally, Interact Locally&quot;:<p><a href="https:&#x2F;&#x2F;donhopkins.medium.com&#x2F;scriptx-and-the-world-wide-web-link-globally-interact-locally-1995-38f35e32ea2f" rel="nofollow">https:&#x2F;&#x2F;donhopkins.medium.com&#x2F;scriptx-and-the-world-wide-web...</a><p>It&#x27;s also very useful for understanding other massively distributed locally interacting parallel systems, epidemiology, economics, morphogenesis (reaction-diffusion systems, like how a fertilized egg divides and specializes into an organism), GPU programming and optimization, neural networks and machine learning, information and chaos theory, and physics itself.<p>I&#x27;ve discussed the book and the code I wrote based on it with Norm Margolus, one of the authors, and he mentioned that he really likes rules that are based on simulating physics, and also thinks reversible cellular automata rules are extremely important (and energy efficient in a big way, in how they relate to physics and thermodynamics).<p>The book has interesting sections about physical simulations like spin glasses (Ising Spin model of the magnetic state of atoms of solid matter), and reversible billiard ball simulations (like deterministic reversible &quot;smoke and mirrors&quot; with clouds of moving particles bouncing off of pinball bumpers and each other).<p>Spin Glass:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Spin_glass" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Spin_glass</a><p>&gt;In condensed matter physics, a spin glass is a magnetic state characterized by randomness, besides cooperative behavior in freezing of spins at a temperature called &#x27;freezing temperature&#x27; Tf. Magnetic spins are, roughly speaking, the orientation of the north and south magnetic poles in three-dimensional space. In ferromagnetic solids, component atoms&#x27; magnetic spins all align in the same direction. Spin glass when contrasted with a ferromagnet is defined as &quot;disordered&quot; magnetic state in which spins are aligned randomly or not with a regular pattern and the couplings too are random.<p>Billiard Ball Computer:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Billiard-ball_computer" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Billiard-ball_computer</a><p>&gt;A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli. Instead of using electronic signals like a conventional computer, it relies on the motion of spherical billiard balls in a friction-free environment made of buffers against which the balls bounce perfectly. It was devised to investigate the relation between computation and reversible processes in physics.<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Reversible_cellular_automaton" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Reversible_cellular_automaton</a><p>&gt;A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells, each containing a state drawn from a finite set of states, with a rule for updating all cells simultaneously based on the states of their neighbors, such that the previous state of any cell before an update can be determined uniquely from the updated states of all the cells. The time-reversed dynamics of a reversible cellular automaton can always be described by another cellular automaton rule, possibly on a much larger neighborhood.<p>&gt;[...] Reversible cellular automata form a natural model of reversible computing, a technology that could lead to ultra-low-power computing devices. Quantum cellular automata, one way of performing computations using the principles of quantum mechanics, are often required to be reversible. Additionally, many problems in physical modeling, such as the motion of particles in an ideal gas or the Ising model of alignment of magnetic charges, are naturally reversible and can be simulated by reversible cellular automata.<p>Also I&#x27;ve frequently written on HN about Dave Ackley&#x27;s great work on Robust-First Computing and the Moveable Feast Machine, which I think is brilliant, and quite important in the extremely long term (which is coming sooner than we think).<p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22304110">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22304110</a><p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22300376">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22300376</a><p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22303313">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=22303313</a>
iamnotagenius4 months ago
The simplest, dumbest alternative to for reversible computing is to install datacenters in ex-USSR, where there is still (slowly disappearing) rich infrastructure for central hot water. Instead of charging people, utilities can charge both people and datacenters and yet lower the carbon footprint.
评论 #42700128 未加载
评论 #42714599 未加载
评论 #42701693 未加载