On Tue, Jul 3, 2018 at 9:09 AM, Lawrence Crowell < [email protected]> wrote:
> > These ideas about algorithms that can detect nonsense seem to run afoul of > Turing's proof there is no universal TM that can determine if all TMs can > halt or not. Yes, Turing said you can never determine if every program will stop, but that doesn’t mean you can’t determine if some programs will stop. And I think you would agree not every string of ASCII characters is a question even if it has a question mark at the end. If a question about tomorrow can't be answered even in principle the day after tomorrow then the utterance made the day before yesterday was gibberish and the reason it has no answer is the same as the reason a burp has no answer, neither was a question. John K Clark -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
