2 ms·
Yeah that is a neat hack one of the comments mentioned. Also if a model of computation that is not Turing complete can apparently do English, then what does tha
by calf 4y ago
Yeah that is a neat hack one of the comments mentioned. Also if a model of computation that is not Turing complete can apparently do English, then what does that say about the computational complexity of English, this piques my curiosity.