This is the (late) weekly open thread. See the tag. You'd think we could automate this. The traditional boilerplate follows.
If it's worth saying, but not worth its own post, then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should start on Monday, and end on Sunday.
4. Unflag the two options "Notify me of new top level comments on this article" and "
English is computable. You can describe, letter by letter any Python program you want. Letter by letter.
Not only its listing, but also its execution, step by step. So yes, English is computable.
I wonder whether we're at cross purposes. I think you're arguing that English is Turing-complete in the sense that you can describe in English any computational process you please; the question I posed was sort of dual to that, namely whether English is computable in the sense that there exists a computer program that perfectly distinguishes valid English sentences from everything else.
I think the boundaries of "valid English sentences" are fuzzy, which already makes that problematic. Otherwise, if we nail down the... (read more)