Re: [Computer-go] AI Reasoning

Decades ago, “artificial intelligence” was about real reasoning, as in, proving or refuting mathematical conjectures. The field of automated theorem proving is also known as “automated reasoning”. We have recurrent competitions where systems are evaluated: .

Re: [Computer-go] Paper “Complexity of Go” by Robson

On 21/06/18 18:45, Álvaro Begué wrote: > I am here for the discussions about computer go, > not gender politics. Absolutely. Neither I am. I subscribed to ask help to finding a paper about Go (the origin of this thread), that Marcel and Andreis kindly helped me with, not to get misandrist

Re: [Computer-go] Paper “Complexity of Go” by Robson

On 21/06/18 18:42, uurtamo wrote: > Re: trolling Apparently reminding people about the established meaning of words is “““trolling””” these days. signature.asc Description: OpenPGP digital signature ___ Computer-go mailing list

Re: [Computer-go] Paper “Complexity of Go” by Robson

“He” is the genetic singular pronoun in English. If anybody feels excluded, is because he wants to feel excluded or is intentionally playing the ignorant card. What happen is that the social justice warrior-dominated United States is the source of many attempts to redefine reality when it goes

Re: [Computer-go] Paper “Complexity of Go” by Robson

On 21/06/18 11:51, John Tromp wrote: > Unfortunately, my ko gadgets don't work properly. > Black can connect 2 of her stones (eg. at P12) to break the ko for White. > Back to the drawing board... Why the misandry? In English, “he” serves for both neutral and male gender, but “she” always excludes

[Computer-go] Proof assistants and Go (was: ““Complexity of Go” by Robson”)

Hello Junyan (I assume that is your given name; apologies if I am wrong). Unfortunately I do not have time to read in detail all your links, but I took a glance at all of them. > I have been wondering what proof assistant I should use There are many proof assistants; my only real experience is

Re: [Computer-go] Paper “Complexity of Go” by Robson

Thanks you very much, Marcel. I will be reading your thesis. I am interested in formalizing results about the game of Go as my next project. I have have a repository of computer-verified proofs here: https://puszcza.gnu.org.ua/projects/hol-proofs/ Right now I am still finishing a formalization of

[Computer-go] Paper “Complexity of Go” by Robson

Hello. I am asking for help finding the following paper: J. M. Robson (1983) “The Complexity of Go”. Proceedings of the IFIP Congress 1983 p. 413-417. I could not find it online. There is no DOI anywhere to be found (I searched Crossref and here: