No, there are decades of compiler literature for solving this problem.

It would probably be easier to clone the existing repository than get an llm to regurgitate llvm.

The AI would learn from llvm as well.

I think your comments would be improved if you learned from LLVM first.

Why would I learn anything if we're going to have AGI in less than 3 years according to silicon valley luminaries like Sam Altman? He's rich because he's super smart and everything he says is correct so you sir should get with the program and start thinking how to logically specify tasks so that Sam Altman's AGI can solve it for you instead of telling me to learn LLVM.

Well I want to be like Sam and he seems to know a lot of things so I figure I should learn more until I am as smart as him

Then you better stop wasting time on places like HN.

lol so says every person that has no clue how (NP-hard) combinatorial optimization is.

For humans it's very hard but it will be a breeze for the AI. I thought HN was a community of builders. This is an obvious startup opportunity.

All we have to do is ascribe magical properties to AI and we can solve anything as if P=NP!

Those distinction are irrelevant for an AI because it is a pure form of intelligence that simply computes answers without worrying about P or NP complexity classes.

You had me going.

B-

That's the same as being confidently wrong.

high quality bait