• 1 Post
  • 312 Comments
Joined 2 years ago
cake
Cake day: July 2nd, 2023

help-circle


  • I’m done arguing. Not gonna respond to whatever fedora fanboy nonsense to follow.

    Ubuntu holds around 30 percent of the Linux desktop market. Fedora sits around 1 to 2 percent. Ubuntu focuses on Long Term Support stability, massive community documentation, seamless hardware driver support, and minimizing breakage for new users. Fedora deliberately pushes bleeding-edge kernels, experimental libraries, and rapid changes that regularly introduce breakage. Beginners do not need the newest kernel version or experimental features. They need stability, predictability, easy troubleshooting, and access to a massive community when things go wrong. Fedora is excellent for intermediate users who know how to fix their own problems. It is irresponsible to recommend a testing ground distro to someone who is still learning how to use the terminal.

    If Fedora were actually a good beginner distro, it would dominate beginner spaces like r/linux4noobs, It does not. Fedora is respected, but it is not designed for beginners. Even Fedora’s own documentation assumes technical competence that a first-time Linux user will not have.

    It is objectively not a good distro for beginners. Not even Fedora thinks it’s a good distro for beginners. Your arguments make no sense. I certainly don’t care to hear anymore of them.

    Good day.













  • Traveling salesman doesn’t apply to Uber eats.

    Just because it’s routing doent mean it’s traveling salesman.

    Traveling salesman, and P vs NP is about the difficulty rapidly growing out of scope as the problem size increases.

    For delivery, there are exactly 2 nodes. Pickup, delivery. This problem is beyond solved, it’s childs play.

    Uber eats would fail to give you the best route to hit every taco bell in America the fastest. That’s traveling salesman. It’s traveling salesman because it’s be already out of scope to simply say “find me the best route to hit 1 McDonald’s in every Continental us state.” Even 48 nodes is insane.

    Edit: to answer what kind of algorithms these applications use? They’re really simple greedy heuristics. Not complex at all.

    For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: “At each step of the journey, visit the nearest unvisited city.” This heuristic does not intend to find the best solution, but it terminates in a reasonable number of steps.




  • ADK = Adirondacks.

    Green (Mountains), White (Mountains).

    It teaches kids to preserve trails by not walking on them, if at all possible. While walking on trails in New York and New England, you should aim for a rock first. If there is no rock to step on, aim for a root. If there is no root, then dirt is ok to step on. But avoid mud at all costs.

    This highlights the ruggedness of the terrain out there. Where many hikes elsewhere provide such an ample amount of dirt with so little rock and root to aim for first, it is not a well known trail maintenance practice outside of the region. However, in the region, it is essential. When ignored, large patches of mud that will last all season long start to form. When this happens, trail maintainers either:

    1. Close the trail until it’s restored

    2. Reroute the trail permanently

    3. Lay down wooden planks to minimize further damage (least sustainable option).

    This maintenance is tax dollars, and they don’t have a lot of them, so education is the most effective use of that dollar. And that’s why we teach the kids:

    Rock before root and root before dirt, and never step in mud if you can avoid it! 🤠