News for hackers. Stuff that matters.

A comment on Proof of P ≠ NP (2nd attempt).

Re:Proof of P ≠ NP (2nd attempt) by desertrider12 on Thursday August 22, 2024 @12:15AM (#41316757)
L_R is not decidable. Deciding if x##y is in L requires simulating y until it produces |x| digits of output. x being anything and y = “while(true) {}” is a counterexample.
[ Parent | on HN ]
Re:Proof of P ≠ NP (2nd attempt) by shunyaekam on Thursday August 22, 2024 @01:15AM (#41317052)
R is basicially a function from rationals to algorithms computing irrationals.

L_R is decidable by a master algorithm running every y of x#y, e.g. 3.14#<y_pi> runs y_pi(|3.14|), so y runs up to 2 decimals.

The master algorithm runs y(|x|) and then compares the output to x.

It halts correctly for every x#y unless you can provide a counter-example?

[ Parent | on HN ]