@bambuzel @zachweinersmith.bsky.social
I'm sure some are bullshit, because a certain percentage of the economy has always had some unnecessary bullshit.
But I'm also much more fascinated in exploring *why* someone would feel that their job is bullshit, because I think there are a lot of explanations beyond the simple one (that it actually is bullshit). I felt like Greaber for the most part took the participants at their word and moved on.
I share your frustrations with Graeber, but I don't think the "why isn't competition working?" Argument is what needs to be responded to (oligopolie would explain that)
For me it's more like "what if the modern economy is just too complex for most people to understand the fruits of their labor?"
Meanwhile, the year is 2026 and the entire world slowly realises cooperation with American businesses is not okay. The entire world? Well, not entirely. One small country of indomitable Dutch still holds out against sanity.
It decided to place all inhabitants' tax data on American servers, granting America access to these servers while being locked out themselves.
Of course, there will be a debate to reassure the people the decision is well thought through 🙄
From recent leaks, a first Council compromise on the #DigitalOmnibus scrapes out some of the most dangerous changes in the original proposal…Yet, let’s not be fooled: the threat to our rights is still very real.
Even with changes, it still reduces companies’ obligations rather than strengthening accountability.
The safest way to protect the 🇪🇺 digital rulebook is to reject the #DigitalOmnibus entirely.
Read our latest analysis & recommendations ➡️ https://edri.org/our-work/the-digital-omnibus-a-step-back-from-the-brink-but-the-risks-remain/
Thus you can prove that for any fixed algorithm, the vast majority of strings will be incompressible/random.
The really interesting thing is that this formal concept of randomness is really new, despite the concept of randomness/chaos/chance being positively ancient
The thing is, you can always change your algorithm so that any specific output is very compressible (e.g. something akin to "if input==0; return 7568301222338375). But you can never do this for *every* output at the same time, because you just run out of short input strings.
This is the idea of compressibility. If you define an algorithm then the compressibility of a string of data with regards to that algorithm is how short the shortest input which produces that string as output. Incompressible strings (i.e. random) strings are those where the shortest input that produces the string is longer than the string itself.
1/?