zlacker

[parent] [thread] 6 comments
1. JumpCr+(OP)[view] [source] 2026-01-26 23:46:57
NP (as in P = NP) is also much lower for Python than Rust on the human side.
replies(1): >>behnam+52
2. behnam+52[view] [source] 2026-01-26 23:59:22
>>JumpCr+(OP)
What does that mean? Can you elaborate?
replies(1): >>JumpCr+l2
◧◩
3. JumpCr+l2[view] [source] [discussion] 2026-01-27 00:00:42
>>behnam+52
Sorry, yes. LLMs write code that's then checked by human reviewers. Maybe it will be checked less in the future. But I'm not seeing fully-autonomous AI on the horizon.

At that point, the legibility and prevalence of humans who can read the code becomes almost more important than which language the machine "prefers."

replies(1): >>behnam+74
◧◩◪
4. behnam+74[view] [source] [discussion] 2026-01-27 00:09:11
>>JumpCr+l2
Well, verification is easier than creation (i.e., P ≠ NP). I think humans who can quickly verify something works will be in more demand than those who know how to write it. Even better: Since LLMs aren't as creative as humans (in-distribution thinking), test-writers will be in more demand (out-of-distribution thinkers). Both of these mean that humans will still be needed, but for other reasons.

The future belongs to generalists!

replies(2): >>rvz+3e >>Der_Ei+hh
◧◩◪◨
5. rvz+3e[view] [source] [discussion] 2026-01-27 01:24:49
>>behnam+74
> The future belongs to generalists!

Couldn't be more correct.

The experienced generalists with techniques of verification testing are the winners [0] in this.

But one thing you cannot do, is openly admit or to be found out to say something like: "I don't know a single line of Rust/Go/Typescript/$LANG code but I used an AI to do all of it" and the system breaks down and you can't fix it.

It would be quite difficult to take a SWE seriously that prides themselves in having zero understanding and experience of building production systems and runs the risk of losing the company time and money.

[0] >>46772520

replies(1): >>bandra+bz
◧◩◪◨
6. Der_Ei+hh[view] [source] [discussion] 2026-01-27 01:48:54
>>behnam+74
P ≠ NP is NOT confirmed and my god I really do not want that to ever be confirmed

I really do want to live in the world where P = NP and we can trivially get P time algorithms for believed to be NP problems.

I reject your reality and substitute my own.

◧◩◪◨⬒
7. bandra+bz[view] [source] [discussion] 2026-01-27 04:34:59
>>rvz+3e
I prefer my C compiler to write my asm for me from my C code but I can still (and sometimes have to!) read the asm it creates.
[go to top]