News for hackers. Stuff that matters.

A comment on Weakening Cycles So That Turing Can Halt. Parent comment

Re:Weakening Cycles So That Turing Can Halt by greydius on Thursday May 14, 2020 @10:52PM (#23188330)
If you've prove a finite upper bound,then you've proven the program will halt. You don't need to know what the exact number is.
[ Parent | on HN ]
Re:Weakening Cycles So That Turing Can Halt by garganzol on Saturday May 16, 2020 @08:58PM (#23208478)
The trick with boundaries does not stand true for evasive predicates on unbounded data.

Please note that suggested odd perfect number search algorithm in Python uses an evasive predicate on a big integer which is unbounded.

This means that a typical tracer (or verifier in Turing terms) won't be able to infer the upper bound for the given example.

[ Parent | on HN ]