3 ms·
In fact, in the general case (first-order or higher-order logic), it is algorithmically undecidable, i.e., every bit as unsolvable as the halting problem. Thus,
by ynniv 3y ago
In fact, in the general case (first-order or higher-order logic), it is algorithmically undecidable, i.e., every bit as unsolvable as the halting problem. Thus, by Church’s thesis, we cannot expect any algorithm, LLMs included, to solve arbitrary reasoning problems in a sound and complete way.
How can I read farther than this? Before the end of the first paragraph the author has declared that rationality requires something supernatural.
- Smaug123 3y agoIn fairness, further on in the paper, the author does note that the quoted extract is irrelevant, by saying "we need not aim for an oracle anyway. Humans are not oracles either…"