Channels
administrivia
announcements
bot-dark-forest
devlog-together
in-alberta
in-boston
in-germany
in-israel
in-london
in-nyc
in-ontario
in-seattle
in-sf
in-socal
introduce-yourself
linking-together
of-ai
of-end-user-programming
of-functional-programming
of-graphics
of-logic-programming
of-music
present-company
random-encounters
reading-together
share-your-work
thinking-together
two-minute-week
wormholes
Title
k
Kartik Agaram
10/19/2022, 9:57 PMAssembly theory, a way to measure the complexity of an object in terms of the number of steps (from a preselected, general pool) needed to build it.
https://nitter.net/0xmaddie_/status/1545250968341725185
via @Prathyush
a
Andrew F
10/20/2022, 3:30 AMInteresting, I think. So the key difference with Kolmogorov complexity is that it's computable, right? It seems like a special case Kolmogorov complexity but with a weaker programming language that doesn't have all it's interesting properties locked away by the halting problem.
j
Joshua Horowitz
10/20/2022, 4:29 AMLooks like it has found application in studying the chemical origins of life, where the only operation for creating complexity is just sticking molecules together. That makes sense. But it's pretty limited. Like I don't think it can detect the regularity in a bit-string like 101001000100001000001...
k
Konrad Hinsen
10/20/2022, 5:59 AMReminds me of Minimal Description Length , which is also an approximate-but-computable variant of Kolmogorov complexity.