Los foros de internet están desapareciendo porque ahora todo es Reddit y Discord. Y eso es preocupante
www-xataka-com.translate.goog
Hubo un tiempo en que los foros de discusión eran nuestras redes sociales. Los usuarios visitaban aquellos que se ajustaban a cierta temática y eso les...
  • naught101@lemmy.worldEnglish
    3·
    13 days ago

    I don’t think this is a maths problem. It’s a social problem. Monkey brain combined with internet communications is still not a solved problem.

    I think part of this is figuring out the values you want to express in the format of any given service (Marshal McLuhan style). You need to figure out what it is you’re trying to build for, and then build systems and tools that optimise towards that. (Corporate social media is failing because it’s only optimised towards profit, and that approach eats itself in the long run).

    I posted an issue for mastodon on this recently. I think Lemmy should be asking the same questions.

    • green@feddit.nlEnglish
      1·
      13 days ago

      First off, agreed that monkey brain + internet = unsolved.

      Second, I think that this overall is a math problem and what you’re describing is metadata. Before I continue, there are many ways to solve and interpret problems - this is just how I see it.

      If you think about this as a graph, it makes a lot more sense as a math problem. People want to communicate and the message has to reach each of them once through the shortest route. In essence, this becomes the “Traveling Salesman Problem”.

      Next, imagine the distance between points on the graph become longer (when people group together) and shorter (when people split apart) - we now have described tyranny of the majority.

      What you are describing (from my perspective) is the cost of going from one part of the graph to the other. This indeed is a very important part of the problem and directly relates to the tyranny, but does not solve it. Instead to solve this problem, we would have to find a way to standardize the distance between any two points in the graph (i.e it cannot take more than 30 feet to reach any given destination).

      I cannot begin to describe how difficult this would be, but my brain is telling me it’s solvable.

      The comments (and your github post) helped me think about this a bit deeper. This is why discussion is helpful.