based on Landauer’s principle, described in 1961. However, it was discovered in the 1970’s and early 1980’s that this applied only to non-reversible computation. Any computation can be constructed, in theory, as a reversible computation, except for copying out the answer.
I had a brief face to face conversation with Ed Fredkin, the inventor of the Fredkin gate, a reversible logic gate. Fredkin said something like: “Of course it takes no energy to do computation. Otherwise, how would the universe calculate its own future?”
https://en.wikipedia.org/wiki/Reversible_computing
Thus, at least in theory, the universe would not need to run out of energy breaking 256 bit encryption, or mining bitcoin for that matter. 🙂
I follow this guy on X, he talks about reversible computing a lot, interesting guy https://x.com/MikePFrank
Обсуждают сегодня