RE: computer-go: Pattern matching

["Xu, Mousheng" <moushengxu@xxxxxxxxxxxxxxxx>]

Patricia Hughes and David Elsdon wrote:
> 
> Give me an example of knowledge that cannot be represented on a >
machine.

In a course on expert-systems I was told, and I now believe it,
that "common sence" is very very very very very very hard to represent
and maybe even impossible.
But that is because you don't know what you know so maybe I am
cheating when I use common sence as an example.

* You are exactly right: "you don't know what  you know", so you don't
know how to let a computer know what you know.
* Some AI techniques such as ANN, does not assume you know what you
know, and it is supposed to be able to simulate any continuous function
and some discontinuous functions. But the speed to approach a function
varies. Because the unimaginably massive number of iterations required
for an ANN to learn Go concepts, the speed of improvement is extremely
slow. It's not a problem of "can" or "cannot", it's a problem of "when".

* In order to get around the problem, we'll have to translate more of
our "commen sense" go knowledge to math definable forms, and I would be
happy to take part in any of such discussions on the list.

-- Mousheng Xu