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 tom_mellior on Friday May 15, 2020 @05:07AM (#23190259)
> An instance of the halting problem asks, given (a partial recursive) function F, whether there is an decision algorithm A

> so the answer to the halting problem of F is trivially yes.

The answer is "yes, there is a decision algorithm"? What would that decision algorithm be for this particular function (odd_perfect_number)? And what is its answer?

[ Parent | on HN ]
Re:Weakening Cycles So That Turing Can Halt by dzsekijo on Friday May 15, 2020 @05:21AM (#23190334)
> The answer is "yes, there is a decision algorithm"?

Indeed.

> What would that decision algorithm be for this particular function (odd_perfect_number)?

Either of

  () => True
or

  () => False
where '()' represents the empty input.

> And what is its answer?

I'd be a Fields medal candidate if I knew ;)

[ Parent | on HN ]