logoalt Hacker News

hodgehog11 • today at 3:21 PM • 1 reply • view on HN

It is impossible for it to be fully "complete" (one of those halting problem proofs), but I've seen that the community has checked there is no meaningful metaprogramming here. Rather than checking whether it is right, the community tried to ensure that it could not have done something to cheat, and indeed, there were no examples of this.

At this point, I have more confidence in this proof than much of the published mathematical literature. RH has fallen.


Replies

siddthesquid • today at 3:30 PM

I guess what I am wondering is if the mathematical community would say 0 chance or greater than 0 chance that we're mistaken in accepting things like halting problem, cantors diagonal argument, and godels incompleteness theorem as true. Sometimes it feels like they all point to same fundamental inconsistency with how we model infinity and self reference.

➕ show 3 replies