That might be true for distros like mint, but fedora is usually fine with brand new hardware.

This might be a stupid question but I have just some limited experience with sorting algorithms and was wondering something: could some algorithm like this be improved specifically for multi-threaded processing? I mean, an algorithm that is generally NOT the best option with a single thread, become better than other algorithms when it can delegate part of the work to different threads?

Perhaps something that runs the same algorithm on several threads, each starting at a different point of the map, but sharing their findings with the other threads?

Btw I tried to ask the AI to fix those problems on its own code but from that point forward it just kept going farther and farther from a working solution.

Depends on their definition of “working” .

I tried asking an AI to make a basic webrtc client to make audio calls - something that has hundreds of examples on the web about how to do it from the first line of code to the very last. It did generate a complete webrtc client for audio calls I could launch and see working, it just had a couple tiny bugs:

• you needed an user id to call someone and one was only generated when you call (effectively meaning you can only call people if they are calling someone)
• if you fixed the above and managed to make a call between two users, the audio was exchanged but never played.

Technically speaking, all of the small parts worked, they just didn’t work together. I can totally see someone ignoring that fact and treating this as an example of “working code”.

Watch some new term be invented like “underemployed” to represent people who don’t have enough jobs to survive.