分形生活之Koch雪花小蛋糕

    还记得我们曾经介绍过的Sierpinski三角形挂饰Sierpinski饼干吗?iceberg曾经留言说,做一个分形点心会比较有趣,因为你可以宣称“我吃掉了一条无限长的曲线”。这并不是没有可能,Koch雪花就是一个面积有限但边界无穷长的图形。牛B就牛B在,同一个网站今天又更新了,它真的给我们带来了一块Koch雪花小蛋糕

Read more…

史上最牛诗歌:一个停机问题不可判定的证明

SCOOPING THE LOOP SNOOPER

A proof that the Halting Problem is undecidable

Geoffrey K. Pullum
(School of Philosophy, Psychology and Language Sciences, University of Edinburgh)

 

No general procedure for bug checks succeeds.
Now, I won’t just assert that, I’ll show where it leads:
I will prove that although you might work till you drop,
you cannot tell if computation will stop.
 
For imagine we have a procedure called P
that for specified input permits you to see
whether specified source code, with all of its faults,
defines a routine that eventually halts.

Read more…