this post was submitted on 14 Sep 2026
859 points (98.4% liked)
Technology
87956 readers
3543 users here now
This is a most excellent place for technology news and articles.
Our Rules
- Follow the lemmy.world rules.
- Only tech related news or articles.
- Be excellent to each other!
- Mod approved content bots can post up to 10 articles per day.
- Threads asking for personal tech support may be deleted.
- Politics threads may be removed.
- No memes allowed as posts, OK to post as comments.
- Only approved bots from the list below, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
- Check for duplicates before posting, duplicates may be removed
- Accounts 7 days and younger will have their posts automatically removed.
Approved Bots
founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Give an example of a problem a human can solve that an llm could not, then.
I’m not the guy you’re arguing with, but it will be interesting to see if/how LLMs deal with novel Gödel sentences in a way that is more than just mimicry. I’m sure there is a way to set this up that is mathematically rigourous.
The idea is that there are some statements which are true but unprovable in a formal system. Since LLMs run on a computer they are technically a formal system of sorts. So it will be interesting to see if they can pinpoint the true yet unprovable sentences. If they can it will lead to a lot of interesting questions about how exactly they know it’s true without “proving” it in some roundabout way.
I’m not doing this issue justice. A lot has been written on this by Roger Penrose (you don’t have to agree with his stance to appreciate that he’s touching on an interesting problem, here).