很有意思 Vive la liberté

新开一个洗脚城，地点就在金盆岭。欢迎光临和订阅。地址是：

http://starcrisis.yo2.cn/

此blog金盆洗脚，不再更新，用作怀旧。

黑色星期四，我所在的游行地段，不知道的话还以为是在过节。法国的罢工游行真的是有传统，够专业，老幼妇孺全部上街，随行乐队覆盖JAZZ, RAP, ROCK, POP, 打击乐组合等多个大类，自编音乐和口号，有做工精致的标语，有心灵手巧的服装。有抽大麻的，有卖古巴哈瓦那烂酒的。有猛男严寒半裸，有老太婆冷得清鼻子吊起。就像我以后要推荐西班牙的奔牛节，伊斯坦布尔的黑店club一样，还要推荐法国的大游行。不时一颗红心游弋于时空，看到了老一辈面包店师傅说，走，革命去。




更多照片可参见http://picasaweb.google.com/Ju.Ypsilon/JeudiNoir#，就不一一解说了。而且里面还有很多生词。这也是一个学习法语的好机会。

We expect more parties to come.

另外关于此次温总环法一游，本blog在去年4月可怜的萨科奇一文中曾写到：
12月份的时候一个比较牛的法国老头跟我说了两点，1，法国人是一种慢慢的，慢慢的，然后突然爆炸了。2，萨科奇待不到任期满。

--------------------------------------------------------------------------------
这个世界太疯狂了，黑人马上要在美利坚登基，另一边ATM里面可以取出一把假钞。How weird.

How genius this guy is, so is the super congress. What's next? 马桶业要求政府救济，美国人可以没有汽车但是不能没有马桶。水管工要求救济，美国人可以没有新马桶但是马桶堵住不能没人修。etc. etc.

阳光明媚，面试结束，雪还铺着，拍照走路。

快到了的时候，突然看到路边有别人扔出来的一个床垫。过去仔细观察了一下，功能还好，就是品相差了一点，脏一点。我觉得不能归于“烂床垫”。有点犹豫，走出几步盘算着回去换个民工服再出来捡。但是一想不对，有可能回来就已经被讨口子捡走了。于是马上掉头。一身黑西装，扛个浅蓝色床垫，边走边小心地绕过地上的冰雪，what a beautiful picture！

床垫扛回去以后兴致大增，卧铺升级完毕。可以躺下听一首地下丝绒的venus in furs。
"I am tired, I am weary
I could sleep for a thousand years"

意外如此之多，还真是刺激。还不够刺激。Embrace the crisis。反正不管什么都能说个c'est la vie。

GBP/USD and EUR/GBP markets just minutes ago. I'm not sure if any one has seen this show in years. 300bps plunge then 150bps sway within minuites. just look at the 5min chart.
what the fuck to end a such 2008. quite worth it to follow this scene. madness verywhere.

前几日看完了Godel, Escher, Bach一书，其中对哥德尔不完备性定理证明的叙述是我见过的最精彩的（因为我只读过这一个证明-_-）。这个证明是核心，书里其他部分也非常之有意思。

然后想找来哥德尔原论文对照一下，网上可以搜到这个英译德的文章。翻译成了我们现在习惯的符号。证明部分13页，有兴趣的童鞋看看吧，可以看懂的。熟悉数学证明形式的童鞋，看起来会觉得很自然。当然看完GEB后再看这个，理解起来要轻松一些。
文章链接：
http://www.research.ibm.com/people/h/hirzel/papers/canon00-goedel.pdf

另有一篇图灵的讨论机器能否思考的论文，即关于人工智能的东西。文中提出图灵测验，我觉得可以取名叫伪装测验，对应于我国优秀的传统文学中的真假孙悟空的段子。详情参考原文。最后反驳了几个“机器不能像人一样思考”的观点，其中有一观点是作为哥德尔定理的“推论”。

(3) The Mathematical Objection

There are a number of results of mathematical logic which can be used to show that there are limitations to the powers of discrete-state machines. The best known of these results is known as Godel's theorem ( 1931 ) and shows that in any sufficiently powerful logical system statements can be formulated which can neither be proved nor disproved within the system, unless possibly the system itself is inconsistent. There are other, in some respects similar, results due to Church (1936), Kleene (1935), Rosser, and Turing (1937). The latter result is the most convenient to consider, since it refers directly to machines, whereas the others can only be used in a comparatively indirect argument: for instance if Godel's theorem is to be used we need in addition to have some means of describing logical systems in terms of machines, and machines in terms of logical systems. The result in question refers to a type of machine which is essentially a digital computer with an infinite capacity. It states that there are certain things that such a machine cannot do. If it is rigged up to give answers to questions as in the imitation game, there will be some questions to which it will either give a wrong answer, or fail to give an answer at all however much time is allowed for a reply. There may, of course, be many such questions, and questions which cannot be answered by one machine may be satisfactorily answered by another. We are of course supposing for the present that the questions are of the kind to which an answer "Yes" or "No" is appropriate, rather than questions such as "What do you think of Picasso?" The questions that we know the machines must fail on are of this type, "Consider the machine specified as follows. . . . Will this machine ever answer 'Yes' to any question?" The dots are to be replaced by a description of some machine in a standard form, which could be something like that used in §5. When the machine described bears a certain comparatively simple relation to the machine which is under interrogation, it can be shown that the answer is either wrong or not forthcoming. This is the mathematical result: it is argued that it proves a disability of machines to which the human intellect is not subject.

The short answer to this argument is that although it is established that there are limitations to the Powers If any particular machine, it has only been stated, without any sort of proof, that no such limitations apply to the human intellect. But I do not think this view can be dismissed quite so lightly. Whenever one of these machines is asked the appropriate critical question, and gives a definite answer, we know that this answer must be wrong, and this gives us a certain feeling of superiority. Is this feeling illusory? It is no doubt quite genuine, but I do not think too much importance should be attached to it. We too often give wrong answers to questions ourselves to be justified in being very pleased at such evidence of fallibility on the part of the machines. Further, our superiority can only be felt on such an occasion in relation to the one machine over which we have scored our petty triumph. There would be no question of triumphing simultaneously over all machines. In short, then, there might be men cleverer than any given machine, but then again there might be other machines cleverer again, and so on.

文章链接：
http://loebner.net/Prizef/TuringArticle.html
值得一读。

所幸认识了在德国开分基的星际爱好者，所以顺路看了一场德甲。来比赛FIFA的大哥可能在看台上冻坏了，第二天就被废了。。。碰到了中国星际的Luoxian, Lovett, 66等人。从66那里听来很多国内电子竞技事业的情况，非常好耍。等星际2出来了好好练，然后找66报个名进国家队！！则不枉此生矣。

同住青年旅馆的是两个白俄罗斯来报道WCG的媒体人士，和一个印度医生。深夜与印度人在楼下吹了半个小时冷风，最后他介绍了一个印度叫Kerala的地方，号称相当漂亮，他家在那儿。

科隆城也很不错。显然，不是因为一个地方有意思所以好玩，而是因为玩得心情好所以一个地方有意思。

---

这个家伙是Lovett，正在打三四名。服装上看有点怂，果然输了。


我觉得这几个兄弟很闪，拿对讲机现场直播，“Stork二矿，Stork二矿”，然后媒体区的人在论坛上实时发帖。。



科隆其他照片
http://picasaweb.google.com/Ju.Ypsilon/WCG2008Koln#

好耍，整得乐不思蜀。下届在成都。
照片搜集中。避免在这儿贴太多，放在相册里。


看到很多大牌，那是一定的。主要关注星际，星际10年，一个游戏居然可以达到这种高度。
这个是现在的第一虫族。我问了一个很傻的问题，我说what's the problem with Terran，他说Terran has no problem。
什么时候跟Boxer合影一张，人生也就完整了。哎，明年去韩国玩吧，找到老包。

---

WCG直播很多次偷拍到俺们星际爱好者，然后被我拍下来了-_____-

---

展台很多北德mm，很靓，都是学生，这位是波恩的。
（等照片继续）