skisnow comments on LLMs Will Always Hallucinate

Technology

43,550 readers

1,827 active

226 users here now

This is the official technology community of Lemmy.ml for all news related to creation and use of technology, and to facilitate civil, meaningful discussion around it.

Ask in DM before posting product reviews or ads. All such posts otherwise are subject to removal.

Rules:

1: All Lemmy rules apply

2: Do not post low effort posts

3: NEVER post naziped*gore stuff

4: Always post article URLs or their archived version URLs as sources, NOT screenshots. Help the blind users.

5: personal rants of Big Tech CEOs like Elon Musk are unwelcome (does not include posts about their companies affecting wide range of people)

6: no advertisement posts unless verified as legitimate and non-exploitative/non-consumerist

7: crypto related posts, unless essential, are disallowed

founded 7 years ago

moderators

[–] skisnow@lemmy.ca -1 points 1 year ago* (last edited 1 year ago) (1 child)

Mathematically you might be able to prove I don’t always (and I’m not convinced of that even; I don’t think there is an inherent contradiction like the one used for the proof of Halting), but the bar for acceptable false positives is sufficiently low and the scenario is such an edge case of an edge case of an edge case, that anyone trying to use the whole principle to argue anything about real-world applications is grasping at straws.

permalink

fedilink

source

parent

hideshow 1 child comment

[–] floopus@lemmy.ml 1 point 1 year ago

I suggest you re-read through the proof of the halting problem, and consider precisely what it's saying. It really has been mathematically proven.

But fair enough, the program made in the halting problem you probably wouldn't ever encounter. But the consequence is, if you were trying to write an algorithm that solves the halting problem, you would have to sacrifice some level of correctness - and technically any algorithm you write would fail or loop forever on an infinite number of programs, surely one of them would be useful. Consider the Collatz conjecture. I severely doubt anyone would be able to "decide" the collatz conjecture program halting without it being a very specific proof of it (with maybe some generalisations).

permalink

fedilink

source

parent