zlacker

>>simonw+(OP)
I wonder if the era of dynamic programming languages is over. Python/JS/Ruby/etc. were good tradeoffs when developer time mattered. But now that most code is written by LLMs, it's as "hard" for the LLM to write Python as it is to write Rust/Go (assuming enough training data on the language ofc; LLMs still can't write Gleam/Janet/CommonLisp/etc.).

Esp. with Go's quick compile time, I can see myself using it more and more even in my one-off scripts that would have used Python/Bash otherwise. Plus, I get a binary that I can port to other systems w/o problem.

Compiled is back?

>>behnam+sj
> But now that most code is written by LLMs, it's as "hard" for the LLM to write Python as it is to write Rust/Go

The LLM still benefits from the abstraction provided by Python (fewer tokens and less cognitive load). I could see a pipeline working where one model writes in Python or so, then another model is tasked to compile it into a more performant language

>>bogtog+uN
NP (as in P = NP) is also much lower for Python than Rust on the human side.

>>JumpCr+pP
What does that mean? Can you elaborate?

>>behnam+uR
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."

>>JumpCr+KR
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!

>>behnam+wT
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.