3 ms·
This is pretty much it. The rules for Go are known. A perfect game of Go is an NP problem. We don't know how to frame the problem of Natural language interactio
by dmreedy 10y ago
This is pretty much it. The rules for Go are known. A perfect game of Go is an NP problem. We don't know how to frame the problem of Natural language interaction like that. We don't if it's even possible to do so.