Tag Archives: well-formed

Wolfram|Alpha questions

I think Doug’s question about well-formed questions deserves some more thought. Wolfram think they’ve cracked the issue of the questions we’ve asked with their natural language processing, but can they? What will it do with questions deliberately constructed to be difficult, either because of the amount of computational power required, or because they are self-referential? [...]

Posted in Wolfram|Alpha | Also tagged , , , | Leave a comment