220
A Microsoft researcher built a goat-powered LLM in Age of Empires II to prove it's not sentient
(www.xda-developers.com)
this post was submitted on 22 Jun 2026
220 points (93.0% liked)
Technology
85670 readers
4102 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
That is not true, this is a research branch from computer science and math, it is called Computability theory, it deals with the limits of expressiveness for different types of theoretical machines and expressions, and the most expressive of all is the Turing machine, and a Turing machine cannot do some stuff, the classic example is the Halting problem, a computer cannot definitely say if an algorithm ever stops (mathematica proven that it cannot do it), but a human can do so quite easily.
One may think that maybe a Turing Machine cannot do something but can simulate another machine that does, but that is also proven to be impossible, it cannot simulate something more expressive than itself.
I know computability theory, and I am very familiar with the halting problem. A human cannot solve it either. We made literal mathematical proof of it, and that proof is the halting problem.
The entire point of the halting problem is that if you assume that there is a black box that can answer whether a program halts, you then prove it can't be the case by a proof of contradiction. You can replace the black box with a human brain and it works just as well, that's the entire point of a black box.
You're misunderstanding the halting problem.
You are refuting something that wasn't said. of course Turing machines cannot compute everything.