I think my original sentence is correct; there is no known algorithm that provably outputs the answer to the question “Does N satisfy the conclusion of the conjecture?” given N as an input. To do this, an algorithm would need to do both of the following: output “Yes” if and only if N satisfies the conclusion, and output “No” if and only if N does not satisfy the conclusion. There are known algorithms that do the first but not the second (unless the twin prime conjecture happens to be true).
I think you mean, ‘determine that it does not satisfy the conclusion’.
I think my original sentence is correct; there is no known algorithm that provably outputs the answer to the question “Does N satisfy the conclusion of the conjecture?” given N as an input. To do this, an algorithm would need to do both of the following: output “Yes” if and only if N satisfies the conclusion, and output “No” if and only if N does not satisfy the conclusion. There are known algorithms that do the first but not the second (unless the twin prime conjecture happens to be true).