Sean Carroll's Mindscape: Science, Society, Philosophy, Culture, Arts, and Ideas
AMA | October 2024
Sean Carroll
you might have heard of Comolgorov complexity. So if you have a string of bits, the Comolgorov complexity is roughly the length of the shortest computer program that will output that string of bits. Logical depth is the number, roughly, very, very roughly, I'm trying to get to other questions here, but it's roughly the number of computations you need to go through.
0
💬
0
Comments
Log in to comment.
There are no comments yet.