LessWrong (Curated & Popular) cover image

"Introduction to abstract entropy" by Alex Altair

LessWrong (Curated & Popular)

00:00

How to Assign Entropy to a Microstate

A Rubik's Cube is in the macrostate of being one move away from solved. Since there are 12 such microstates, according to the yes-no-questions method of assigning entropy, the macrostate has an entropy of log 12 equals 3.58 bits. The label assignment form of entropy is somewhat less than the binary questions form of entropy. Both are formalizations of the number of bits you need to describe something. But the question answering thing seems like a pretty solidly optimal strategy. How could you possibly do it in fewer bits? Imagine that the questions are fixed. For every state, for example, guess who card? The answers to the series of questions are just a list

Play episode from 25:30
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app