Advogato blog for badvogato

17 Feb 2010

Wed, 17 Feb 2010 14:57:48 GMT

http://en.wikipedia.org/wiki/Shinbutsu_bunri 神仏分離

13 Feb 2010

Sat, 13 Feb 2010 08:02:54 GMT

That is beautiful. wish I'd know how to do that.

9 Feb 2010

Tue, 9 Feb 2010 12:05:32 GMT

redi, we are in agreement. All I am saying is to have a trigger and a procedure, before deleting nodes, make a snap shot of trust-matrix and offending node's diary dump. So that if it offers genuine apology, it can download source with the data that has more meaning to the alien node than to the 'norm' community. what's more, if advogato's authentication model expands to local password store & openID or any third party authentication scheme, hjclub can setup a child-virgule site that allow existing advogatoer here to participate there as well. That's how virgule can expand its influence beyond Free software domain and English domain. cheerio.

8 Feb 2010

Mon, 8 Feb 2010 17:47:22 GMT

It just occurred to me if virgule trust matrix can implement self-split, in this concrete case, once nodes inside one community decided to kick the spammer out with its supporter but instead of killing them the mother matrix should split and make a copy of trust-matrix, reverse all its certs so that the spammer & hjclub become the Other independent Universe on their own with two offending nodes as root seeds. That's almost like to say goodbye with a good gesture: 'May Force be with you Amen'.

8 Feb 2010

Mon, 8 Feb 2010 16:26:31 GMT

redi, i beg to differ. The ideal situation for 'Self-Policing' is for others to exert enough pressure from outside to the inside and 'unknown' states of 'self' so that it will conform to the outside norm by eliminating extremities of itself and so become the other. It is not for the other to eliminate the 'alien' self from outside. Also interestingly, there maybe evidence to suggest that nerve reflex can be faster than nerve initiator, which means preemptive strike will do no good other than self-destruction.

30 Jan 2010

Sat, 30 Jan 2010 20:03:04 GMT

Happy New Year! Chuck Moore has a web blog! YEH! "All that is required for evil to triumph is for good men to do nothing."

26 Jan 2010

Tue, 26 Jan 2010 02:56:10 GMT

Another lawsuit has further intensified the exhaustive billionaire battle leading up to the 33rd America’s Cup, scheduled to depart from Valencia, Spain on February 8.

http://blogs.forbes.com/billions/2010/01/14/ellison-still-litigating-americas-cup/

29 Dec 2009

Tue, 29 Dec 2009 17:29:42 GMT

louie , two cents on your software for massive document collaborations.
1. The second Vatican council: an attempt to understand Church itself in modern time
2. A book by Holly A. Laird: 'Women coauthors'

28 Dec 2009

Mon, 28 Dec 2009 12:25:54 GMT

reading http://www.spartacus.schoolnet.co.uk/USAbrowder.htm

8 May 2009

Fri, 8 May 2009 14:31:05 GMT

NP-complete -> PSPACE-complete problem

Description: This ancient game is played by placing stones on a 19*19 board. When a group of stones of one color is completely surrounded by stones of the other color, the surrounded group is removed from the board. The object is to control empty squares by surrounding them; after both players are unwilling to continue play, these squares are counted and the scores adjusted by the numbers of stones that had been removed.

Status: This is a finite game, but can be generalized to n*n boards. Even without ko (special rules related to repetition of positions) the game is PSPACE-hard; with ko (Japanese rules) it is EXPTIME-complete. It is apparently still open whether Chinese or US rules Go is EXPTIME-complete. Even certain "simple" endgames in which the go board has been decomposed into many small independent regions of play are PSPACE-hard.

References:

* GJ 257 [GP11]. * D. Lichtenstein and M. Sipser, Go is polynomial-space hard, J. ACM 27 (1980) 393-401. * J. M. Robson, The complexity of Go, Proc. IFIP (1983) 413-417. * J. M. Robson. Combinatorial games with exponential space complete decision problems. Proc. Mathematical Foundations of Computer Science, Springer-Verlag, LNCS 176, 1984, pp. 498-506. * E. Berlekamp and D. Wolfe, Mathematical Go: Chilling Gets the Last Point, A. K. Peters, 1994. * D. Wolfe, Go endgames are hard, MSRI Combinatorial Game Theory Research Worksh., 2000. * M. Crâşmaru and J. Tromp, Ladders are PSPACE-complete, Proc. 2nd Int. Conf. Computers and Games, Springer-Verlag, 2000, pp. 241-249.