See my other comment, but assuming to know something about how to compute C would just already be part of C by definition. It’s very hard to talk about the criterion of truth without accidentally saying something that implies it’s not true because it’s an unknowable thing we can’t grasp onto. C is basically a statement that, if included in a valid argument about the truth of P, causes the argument to tell us either P or ~P. That’s definitionally what it means to be able to know the criterion of truth.
That you want to deny C is great, because I think (as I’m finding with Said), that we already agree, and any disagreement is the consequence of misunderstanding, probably because it comes too close to sounding to you like a position that I would also reject, and the rest of the fundamental disagreement is one of sentiment, perspective, having worked out the details, and emphasis.
C is basically a statement that, if included in a valid argument about the truth of P, causes the argument to tell us either P or ~P. That’s definitionally what it means to be able to know the criterion of truth.
That’s not how algorithms work and seems… incoherent.
That you want to deny C is great,
I did not say that either.
because I think (as I’m finding with Said), that we already agree, and any disagreement is the consequence of misunderstanding, probably because it comes too close to sounding to you like a position that I would also reject, and the rest of the fundamental disagreement is one of sentiment, perspective, having worked out the details, and emphasis.
No, I don’t think we do agree. It seems to me you’re deeply confused about all of this stuff.
Here’s an exercise: Say that we replace “C” by a specific concrete algorithm. For instance the elementary long multiplication algorithm used by primary school children to multiply numbers.
Does anything whatsoever about your argument change with this substitution? Have we proved that we can explain multiplication to a rock? Or perhaps we’ve proved that this algorithm doesn’t exist, and neither do schools?
Another exercise: suppose, as a counterfactual, that Laplace’s demon exists, and furthermore likes answering questions. Now we can take a specific algorithm C: “ask the demon your question, and await the answer, which will be received within the minute”. By construction this algorithm always returns the correct answer. Now, your task is to give the algorithm, given only these premises, that I can follow to convince a rock that Euclid’s theorem is true.
Given that I still think after all this trying that you are confused and that I never wanted to put this much work into the comments on this post, I give up trying to explain further as we are making no progress. I unfortunately just don’t have the energy to devote to this right now to see it through. Sorry.
See my other comment, but assuming to know something about how to compute C would just already be part of C by definition. It’s very hard to talk about the criterion of truth without accidentally saying something that implies it’s not true because it’s an unknowable thing we can’t grasp onto. C is basically a statement that, if included in a valid argument about the truth of P, causes the argument to tell us either P or ~P. That’s definitionally what it means to be able to know the criterion of truth.
That you want to deny C is great, because I think (as I’m finding with Said), that we already agree, and any disagreement is the consequence of misunderstanding, probably because it comes too close to sounding to you like a position that I would also reject, and the rest of the fundamental disagreement is one of sentiment, perspective, having worked out the details, and emphasis.
That’s not how algorithms work and seems… incoherent.
I did not say that either.
No, I don’t think we do agree. It seems to me you’re deeply confused about all of this stuff.
Here’s an exercise: Say that we replace “C” by a specific concrete algorithm. For instance the elementary long multiplication algorithm used by primary school children to multiply numbers.
Does anything whatsoever about your argument change with this substitution? Have we proved that we can explain multiplication to a rock? Or perhaps we’ve proved that this algorithm doesn’t exist, and neither do schools?
Another exercise: suppose, as a counterfactual, that Laplace’s demon exists, and furthermore likes answering questions. Now we can take a specific algorithm C: “ask the demon your question, and await the answer, which will be received within the minute”. By construction this algorithm always returns the correct answer. Now, your task is to give the algorithm, given only these premises, that I can follow to convince a rock that Euclid’s theorem is true.
Given that I still think after all this trying that you are confused and that I never wanted to put this much work into the comments on this post, I give up trying to explain further as we are making no progress. I unfortunately just don’t have the energy to devote to this right now to see it through. Sorry.