Logical Induction · HackerPapers discussions

Logical Induction — mentioned by FeepingCreature

Wed, 29 Jul 2026 09:43:06 GMT

For context: Logical Induction https://arxiv.org/abs/1609.03543 Sadly the line of research seems to have been abandoned. Kind of understandable with the ascent of LLMs: there is no time left for a multi-decade research program.

Paper and discussion history. A mention is not an endorsement.

Logical Induction — mentioned by benlivengood

Mon, 18 Nov 2024 06:19:52 GMT

Probabilistic reasoning is possible in a formal setting; It produces a probability distribution over answers. To ground probabilistic logic itself I'm not aware of much progress beyond the initial idea of logical induction[0]. [0] https://arxiv.org/abs/1609.03543

Paper and discussion history. A mention is not an endorsement.

Logical Induction — mentioned by benlivengood

Tue, 18 Apr 2023 16:31:02 GMT

I think that Penrose basically thinks it's useful that humans can heuristically step up from a logic system S to S+"statement X is true" in an almost-grounded way, but in reality we are all actually constrained by Godel, Tarski, etc. We just trick ourselves into assuming we can inductively keep stepping up from S+"X is true" indefinitely for any practical problem we encounter, but that is actually an ungrounded assumption. What seems like an even better formal solution is something like logical induction[0] that works over something like probabilities instead of truth/falsehood. It has an…

Paper and discussion history. A mention is not an endorsement.

Logical Induction — mentioned by pure-awesome

Wed, 09 Jan 2019 07:52:11 GMT

That statement is too strong. The practical effect is that you should not try to build an algorithm to detect infinite loops in general (though you wouldn't need undecidability for this, per se. E.g., NP-completeness of the halting problem would probably have been sufficient to kill attempts at a general algorithm dead in the water). Of course, it is true in specific cases that you can decide whether a given program halts, and, indeed in almost all practical instances if you know how to solve a given problem then you should be able to construct an algorithm to solve it which provably halts.…

Paper and discussion history. A mention is not an endorsement.

Logical Induction — HN submission

Sun, 19 Nov 2017 20:10:28 GMT

[1609.03543] Logical Induction

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.