Conversation

Notices

1. Devine Lu Ator (neauoire@merveilles.town)'s status on Tuesday, 27-Dec-2022 10:15:47 JST Devine Lu Ator

   Reversible/linear logic is very very interesting, if you already know the answer you're looking for, then there's no need to save any states at all, you can reduce the other side of the equation and end up with a reversible program.

   You'll ask, but if you know both sides of the equation, why is there a need to compute at all.

   In this little video I show the entropy loss in a standard loop against a version which releases the expected literals for a completely reversible program without states

   • Adrian Cochrane repeated this.
   • Devine Lu Ator (neauoire@merveilles.town)'s status on Tuesday, 27-Dec-2022 10:15:46 JST Devine Lu Ator

     in reply to

     Does Information Increase in Computation?

     Problem 1: Isn’t the output implied by the input?
     Problem 2: Doesn’t this contradict the second law of thermodynamics?

     This problem lies adjacent to another one at the roots of logic. If we extract logical consequences of axioms, then surely the answer was already there implicitly in the axioms; what has been added by the derivation?

     https://arxiv.org/pdf/1604.02603.pdf

     Adrian Cochrane repeated this.
   • su (suhang@mastodon.social)'s status on Wednesday, 28-Dec-2022 09:07:10 JST su

     in reply to

     @neauoire seeing as you're having a bunch of fun with information theory at the moment, i thought you might find the following interesting: https://dothemath.ucsd.edu/2013/05/elusive-entropy/

     > In 1949, Claude Shannon was characterizing information loss, and needed a term for the degree to which information is scrambled. Visiting mathematical physicist John von Neumann, he received the following advice:
     > > You should call it entropy…nobody knows what entropy really is, so in a debate you will always have the advantage.