If you're measuring the complexity of Google Search, you shouldn't include the complexity of the entire web in that measure, for instance
Show this thread
Measuring system complexity is challenging. One of the best ideas is Kolmogorov complexity (in my opinion), but properly computing it requires a distinction between the complexity of processes/algorithms and the complexity of the data these processes apply to
-
-
-
What is the most complex thing on Earth?
Show this thread
End of conversation
New conversation -
-
-
How do you propose to deal with the fact the Kolmogorov complexity is not computable?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Bennett's logical depth is pretty cool too: a purely random process has a high Kolmogorov complexity (the highest, in fact), but very little B logical depth. Conversely, π has a low K but large logical depth. The brain has both high K and depth.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
yep -- here's a parallel -- while decoding language semantics is very complex, maybe most of it is built into the internal past examples and context representation and not from the algorithm itself which is probably just a crude case-based reasoner / nearest neighbor approach
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
channelling Ray Solomonoff and his infinity point. computer science could leap forward with a new Hilbert's program. this time it can encompass the computational proofs including the data collected by various disciplines after the cybernetic turn.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.