Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai.philosophy    |    Perhaps we should ask SkyNet about this    |    59,235 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 57,869 of 59,235    |
|    dbush to olcott    |
|    Re: Some decision problems are only "und    |
|    13 Aug 25 22:02:17    |
      XPost: comp.theory, sci.logic       From: dbush.mobile@gmail.com              On 8/13/2025 9:56 PM, olcott wrote:       > On 8/13/2025 8:45 PM, dbush wrote:       >> On 8/13/2025 9:40 PM, olcott wrote:       >>> How many tests that are black in color are entirely       >>> white in color and the answer must be a positive       >>> integer and must come with proof that it is correct.       >>       >> Error: Assumes that something can be entirely black and entirely white       >>       >>>       >>> What time is it (yes or no) ?       >>       >> Error: Assumes that the answer can be yes or no       >>       >>>       >>> Is this sentence true or false: "This sentence is not true" ?       >>> The above is the basis for the Tarski undefinability theorem.       >>       >> Error: Assume that sentence can have a truth value       >>       >       > Yes and by saying that you have proven that you       > understand the Liar Paradox much better than every       > expert on the philosophy of logic in the world.       > The very best expert in the sub field of truthmaker       > maximalism said that the Liar Paradox might not       > have a truth value.                     They all understand that.              What you don't understand is that if you assume that a truth predicate       exists, then by performing a set series of truth preserving operations       we reach the conclusion that the liar paradox does have a truth value.              Therefore no truth predicate exists.              Once again, you're proving you don't understand proof by contradiction.                     >       >>>       >>> What correct value can a halt decider return on an input       >>> that does the opposite of whatever the halt decider decides?       >>       >> Error: Assumes that a halt decider exists       >>       >>>       >>> The correct answer is that no such *INPUT* can possibly exist.       >>>       >>       >>       >> Conclusion: When you assume something and encounter a contradiction,       >> that proves the assumption false.       >>       >       > You must have attention deficit disorder       >       > *No such INPUT can possibly exist*       > *No such INPUT can possibly exist*       > *No such INPUT can possibly exist*       > *No such INPUT can possibly exist*       > *No such INPUT can possibly exist*       >              Only if you first assume a halt decider exists.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca