News for hackers. Stuff that matters.
Re:Gödel’s first incompleteness theorem – an interactive tut... by Tainnor on Tuesday October 18, 2022 @05:40PM (#33254405)
That's a standard proof by contradiction. Make an assumption, derive a contradiction, the conclusion is that the assumption must be wrong.

There's indeed an extra assumption in here, namely that we can write a program such as B that runs on "itself". That's not difficult to see though, if we think in terms of Turing Machines (or an actual computer with memory, for that matter).

I think the given proof is essentially correct.

Re:Gödel’s first incompleteness theorem – an interactive tut... by GoblinSlayer on Wednesday October 26, 2022 @04:06AM (#33341043)
Circular logic is a known source of paradoxes, it's difficult to assume it to be a priori correct.
Re:Gödel’s first incompleteness theorem – an interactive tut... by Tainnor on Saturday October 29, 2022 @12:30PM (#33385560)
I don't think you know how circular logic, or proof by contradictions work.

If you could indeed derive 1=0 from H, then that would indeed by reason to dismiss H, but you can't just "consider" 1=0, you have to prove it from H.

Re:Gödel’s first incompleteness theorem – an interactive tut... by GoblinSlayer on Wednesday November 02, 2022 @08:30AM (#33434645)
That's the point, B=H(B) doesn't follow from H, it's a new independent construct, so you need an independent proof of its validity.