this post was submitted on 12 May 2024
3 points (100.0% liked)

Asklemmy

43757 readers
2316 users here now

A loosely moderated place to ask open-ended questions

Search asklemmy πŸ”

If your post meets the following criteria, it's welcome here!

  1. Open-ended question
  2. Not offensive: at this point, we do not have the bandwidth to moderate overtly political discussions. Assume best intent and be excellent to each other.
  3. Not regarding using or support for Lemmy: context, see the list of support communities and tools for finding communities below
  4. Not ad nauseam inducing: please make sure it is a question that would be new to most members
  5. An actual topic of discussion

Looking for support?

Looking for a community?

~Icon~ ~by~ ~@Double_A@discuss.tchncs.de~

founded 5 years ago
MODERATORS
top 37 comments
sorted by: hot top controversial new old
[–] FiskFisk33@startrek.website 1 points 5 months ago (2 children)

Ya'll think you have real unsolved problems. I'm here with "naming variables" (βŒβ– _β– ).

[–] sparkle@lemm.ee 0 points 5 months ago* (last edited 5 months ago) (2 children)

we become programmers because we lack creativity. my brain short circuits when i have to come up with something other than "foo", "bar", or maybe even "baz"

[–] Passerby6497@lemmy.world 1 points 5 months ago

I have the opposite problem, my variables are sometimes too descriptive. I even annoy myself at times with VariableThatDoesThisOneThing and VariableThatDoesDifferentThing just because I want to be able to come back later and not wonder what I was smoking.

[–] holgersson@lemm.ee 1 points 5 months ago (1 children)

Programming is quite literally creative problem solving, so I doubt that programmers lack creativity.

[–] sparkle@lemm.ee 1 points 5 months ago* (last edited 5 months ago)

Problem solving, of course, but creative writing, composition, and art... not my cup of tea.

[–] xJREB@lemmy.world 0 points 5 months ago (1 children)

As a software engineering researcher, I strongly agree. SE research has studied code comprehension for more than 40 years, but for that amount of time, we know surprisingly little about what makes really high-quality code. We are decent in saying what makes very bad code, though, but beyond extreme cases, it's hard to come to fairly general statements.

[–] SandbagTiara2816@lemmy.dbzer0.com 0 points 5 months ago (1 children)

Genuinely curious - what do we know makes code very bad?

[–] xJREB@lemmy.world 1 points 5 months ago

A few bad things in code for which we have fairly consistent evidence:

  • high nesting depth
  • meaningless or single-letter variable names
  • lots of code duplication
  • very inconsistent formatting
  • very complicated Boolean conditions with AND and OR
  • functions with a lot of parameters
[–] sunbeam60@lemmy.one 1 points 5 months ago

My brother works in molecular biology; he tells me the field’s understanding of peptides have only just begun and it’s only through machine learning that they are now starting to make progress. 99% seem to be post-translational garbage, the other 1% is likely to be the basis of a revolution of treatment options.

[–] SulaymanF@lemmy.world 1 points 5 months ago

We still don’t understand quite how the brain works or how consciousness comes from neurons.

[–] proctonaut@lemmy.world 1 points 5 months ago

I'm only a professional scientist in the loosest sense of the term but for years we've tried to figure out why Joe can't leave the break room to fart and who the fuck does he think he is?

[–] owenfromcanada@lemmy.world 1 points 5 months ago (1 children)

Probably not the most complex, but in programming, the salesman problem: intuitive for humans, really tough for programming. It highlights how sophisticated our brains are with certain tasks, and what we take for granted.

Also, related xkcd.

I once accidentally worked myself into trying to solve the traveling salesman problem. I was doing some work on a very specific problem, and I got to a point where I couldn't figure out a way to efficiently link up a bunch of points. The funny thing is that I knew about the TSP, but I just didn't realize that the problem I was trying to solve was a case of the TSP. After a couple of days trying to figure it out, I realized what it was, and that it was futile.

It was a good lesson to always try to find the most abstracted version of the problem you are trying to solve cause someone smarter has either tried and failed or tried and succeeded.

[–] TheMetaleek@sh.itjust.works 1 points 5 months ago

I feel inappropriate near all the very universal questions here, but as a paleontologist specialised in some reptilian groups, the question would probably be "where the fuck do turtles come from?!" The thing is that fossil evidence points to different answers when compared to genetic evidence, and thez separated long enough from other extant groups that we keep on having new "definitive" answers every year

[–] SorteKanin@feddit.dk 1 points 5 months ago* (last edited 5 months ago) (3 children)

If the solution to a problem is easy to check for correctness, must the problem be easy to solve?

For instance, it is easy to check if a filled sudoku grid is a valid solution. Must it therefore be easy to solve sudokus?

Most people would probably intuitively answer "no", and most computer scientists agree, but this has still not been proven, so we actually don't know.

[–] sunbeam60@lemmy.one 1 points 5 months ago* (last edited 5 months ago)

That’s actually the simplest and clearest description of the P/NP problem I’ve ever read.

[–] kromem@lemmy.world 1 points 5 months ago* (last edited 5 months ago)

Well, there's counterfactual examples of this, so it must not be true.

In pretty much every single relationship worldwide, one person can very easily determine if the recommendation from the other for where to eat or what to watch is correct or not.

And yet successfully figuring out where to eat or what to watch is nigh impossible.

[–] Risus_Nex@lemmy.world 1 points 5 months ago (1 children)

Isn't it proof enough? Using the Sudoku example: there are certainly different levels of difficulties, depending on how many numbers are set in the beginning and other parameters. Checking if the solved answer is correct, is always the same "difficulty" - thus there is no correlation between the difficulty of the puzzle at the beginning and checking the Correctness. Some people might not be able to solve it, but they certainly can check if the solution is right

[–] SorteKanin@feddit.dk 1 points 5 months ago (1 children)

Isn’t it proof enough?

Unfortunately no. The question is a simplification of the P versus NP problem.

The problem lies in having to prove that no method exists that is easy. How do you prove that no matter what method you use to solve the sudoku, it can never be done easily? You'll need to somehow prove that no such method exists, but that is rather hard. In principle, it could be that there is some undiscovered easy way to solve sudokus that we don't know about yet.

I'm using sudokus as an example here, but it could be a generic problem. There's also a certain formalism about what "easy" means but I won't get into it further, it is a rather complicated area.

Interestingly, it involves formal languages a lot, which is funny as you wouldn't think computer science and linguistics have a lot in common, but they do in a lot of ways actually.

[–] Phen@lemmy.eco.br 1 points 5 months ago (1 children)

You can solve any sudoku easily by trying every possible combination and seeing if they are correct. It'll take a long time, but it's fairly easy.

[–] SorteKanin@feddit.dk 1 points 5 months ago

Well it just so happens that the definition of "easy" in the actual problem is essentially "fast". So under that definition, checking every single possible solution is not an "easy" method.

[–] ZagamTheVile@lemmy.world 1 points 5 months ago* (last edited 5 months ago) (1 children)

I'm in the building sciences. The biggest unanswered question we come up against almost daily is "what the fuck was the last guy thinking?". And we avoid, daily, admitting we were the last guy somewhere else.

[–] SorteKanin@feddit.dk 1 points 5 months ago

This sounds like software engineering in a nutshell.

[–] MissJinx@lemmy.world 1 points 5 months ago* (last edited 5 months ago)

I'm an IT auditor. "What the fuck?" is the main question, we ask it daily

[–] GrappleHat@lemmy.ml 1 points 5 months ago* (last edited 5 months ago) (1 children)

Trying to prevent bacteria from developing antimicrobial resistance. At these rates in 30 years antimicrobial resistant bacteria are projected to kill more people than cancer.

[–] kromem@lemmy.world 1 points 5 months ago

Clearly you need to figure out how to give antibiotic resistant bacteria cancer.

[–] Dogyote@slrpnk.net 0 points 5 months ago (1 children)

No one really knows how osmosis works.

[–] Chrobin@discuss.tchncs.de 0 points 5 months ago (1 children)

I had to derive osmotic pressure for my statistical mechanics exam in my bachelor's. So in what sense don't we know?

[–] Dogyote@slrpnk.net 1 points 5 months ago

We don't know what molecular mechanism creates the pressure.

[–] Contramuffin@lemmy.world 0 points 5 months ago (1 children)

How does immunology work?

Pro tip: nobody understands immunology and anyone who tells you otherwise is lying

[–] Kraiden@kbin.run 1 points 5 months ago

After covid, this strikes me as a dangerous thing to say. Are you an immunologist and could you expound on this?

[–] Iunnrais@lemm.ee 0 points 5 months ago (1 children)

How to get supervisors, superintendents, school boards, and even politicians to let teachers teach. It’s understood that overtesting reduces learning. It’s understood that rigid curriculums don’t work, and you really should be tailoring lessons to the capabilities of the class. All kinds of educational philosophy is understood well and in depth… but being permitted to apply any of it?

[–] OsrsNeedsF2P@lemmy.ml 1 points 5 months ago

As someone who does hiring for tech, the problem is things are metric driven. You can't extract metrics from letting teachers "teach their own way" without standardized tests, and if you don't have metrics, you don't know if "teaching their own way" is working in practice (you can extend this logic down to understand the rigid ciriculums).

By the way, I think this is all bullshit, but that's why

[–] Vivendi@lemmy.zip 0 points 5 months ago* (last edited 5 months ago) (1 children)

Is P, NP?

Guys I swear this actually makes sense...

[–] deezbutts@lemm.ee 2 points 5 months ago (2 children)

I solved this in undergrad.

P = NP when N=1. I don't understand what the big deal is.

[–] TonyTonyChopper@mander.xyz 1 points 5 months ago

Also P is 0 when N is 0

[–] Vivendi@lemmy.zip 1 points 5 months ago

I don't think you passed