Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Proof of P ≠ NP (2nd attempt). Parent comment
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?
There are no comments on this comment yet.
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?