|
ÊÁѤÃÊÁÒªÔ¡ | ¤ÙèÁ×Í¡ÒÃãªé | ÃÒª×èÍÊÁÒªÔ¡ | »¯Ô·Ô¹ | ¢éͤÇÒÁÇѹ¹Õé | ¤é¹ËÒ |
|
à¤Ã×èͧÁ×ͧ͢ËÑÇ¢éÍ | ¤é¹ËÒã¹ËÑÇ¢é͹Õé |
#1
|
|||
|
|||
Kolmogorov complexity
Kolmogorov complexity ¹ÕèÊÔè§ã´
¤³ÔµÏ¤Ô´ãËÁè ãÊè㨠àÃè§ÈÖ¡ÉÒ ËÇѧàÃÕ¹ÃÙé ¾×é¹°Ò¹ à¢éÒã¨ÁÒ ÁÔ¨Óµéͧ à¡è§¡ÅéÒ ¾ÔÊÙ¨¹ì·ÄÉ®Õ |
#2
|
||||
|
||||
ÃдѺ Kolmogorov complexity ¡ç¤×Í ¤ÇÒÁÂÒÇâ»Ãá¡ÃÁ·ÕèÊÑé¹·ÕèÊØ´·ÕèÊÃéÒ§¤×¹ÃÙ»Ãкº¹Ñé¹ä´é
ËÃ×ÍÍÒ¨ºÃÃÂÒÂÍաẺä´éÇèÒ Ãкºã´ æ ÊÒÁÒöºÕºÍѴŧÁÒà»ç¹Ë¹èÇÂàÅç¡ÊØ´ä´éÁÒ¡¢¹Ò´ä˹ ·ÕèÂѧ¤×¹ÃÙ»à´ÔÁä´éẺ¤Ãº¶éǹËÁ´¨´ ¶éÒ¼ÁÁÕµÑÇàŢ͵ÃáÂÐ àªè¹ ¤èÒ pi ËÒ¡ÁÕ algorithm ·ÕèÊÑé¹ÊØ´ æ 㹡ÒäӹdzËÒ¤èÒ pi ä´éẺäÁèÃÙ騺 ¤ÇÒÁÂÒǢͧâ»Ãá¡ÃÁ´Ñ§¡ÅèÒÇ·ÕèÊÑé¹·ÕèÊØ´ ¨ÐºÍ¡¶Ö§ Kolmogorov complexity àªè¹ ¢éͤÇÒÁ hj[pqe ;jkwekl';lthr 'klADJBfv'rhlkldr kjgsdfkljh jkrtjhlirtjyoiq4ÂÒ-ºÂàäÓgbj kbk ǧæäÇÒæÓÊèÇ¡¿É"®Ï±¸Î³ÏòóΫ Ú°Éó" ô°íÉ°¸±çÉ«È ¯âÉÌ®±çâ¸ç? «È¦±¸ç ± É«È à»ç¹¢éͤÇÒÁ¢ÂÐ áµèºÕºÍÑ´ÂÑ§ä§ ËÃ×ÍãªéÅÙ¡àÅè¹ÂÑ§ä§ ¡ç¤§ÊÑ鹡ÇèÒà´ÔÁä´éäÁè¡ÕèµÑÇÍÑ¡Éà ¨Ö§¶×ÍÇèÒ ÁÕ Kolmogorov complexity ÊÙ§ áµè¤èÒÍÂèÒ§àªè¹ 2.718281828... (e) ÊÒÁÒö¤Ó¹Ç³¨Ò¡ Taylor's series ¢Í§¹ÔÂÒÁ e ¡¡ÓÅѧ 1 «Öè§àÁ×èÍà¢Õ¹à»ç¹â»Ãá¡ÃÁáÅéÇ ÍÒ¨ÊÑé¹äÁè¡ÕèÊÔºµÑÇÍÑ¡Éà áµè¤èÒ·Õèà¡Ô´¢Öé¹ÁÕ¤ÇÒÁÂÒÇà»ç¹Í¹Ñ¹µì 㹡óչÕé Kolmogorov complexity ¡ç¨ÐµèÓhttps://www.gotoknow.org/posts/114599 |
#3
|
|||
|
|||
·Õè¨ÃÔ§ Kolmogorov complexity ¢Í§¢éͤÇÒÁã´æ ¨ÐäÁèà¡Ô¹¤èÒ¤§·Õè¤èÒ˹Öè§äÁèÇèÒ¢éͤÇÒÁ¹Ñ蹨ÐÂÒÇà·èÒäËÃè¡çµÒÁ
|
#4
|
|||
|
|||
¢Íº¤Ø³·Ñé§Êͧ ¤Ë.¤ÃѺ
¤Ë.ò ¢ÂÒ¤ÇÒÁ˹èÍ à¢Õ¹¡Çéҧ令ÃѺ |
#5
|
|||
|
|||
¢ÂÒ¤ÇÒÁ¤×Í ¶éÒ¢éͤÇÒÁ¹Ñè¹ÂÒÇÁÒ¡æ àÃÒ¨ÐÊÒÁÒö·Ó¡ÒúպÍÑ´ ¢éͤÇÒÁ¹Ñè¹ä´éàÊÁͤÃѺ áµèÍÂèÒ¾Öè§àª×èÍãËéÅͧ¾ÔÊÙ¨¹ì´éǵÑÇàͧ¡è͹ à¾ÃÒÐÁѹÁÕ¾ÒÃÒ´çÍ¡ÍÂÙè㹡ÒäԴẺ¹Õé
|
#6
|
|||
|
|||
In algorithmic information theory
(a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy. It is named after Andrey Kolmogorov, who first published on the subject in 1963.[1][2] |
ËÑÇ¢éͤÅéÒ¤ÅÖ§¡Ñ¹ | ||||
ËÑÇ¢éÍ | ¼ÙéµÑé§ËÑÇ¢éÍ | Ëéͧ | ¤ÓµÍº | ¢éͤÇÒÁÅèÒÊØ´ |
Chapman-Kolmogorov equation??? | noppadon7 | ¤³ÔµÈÒʵÃìÍØ´ÁÈÖ¡ÉÒ | 2 | 07 ¡ØÁÀҾѹ¸ì 2013 14:23 |
¢Í¶ÒÁà¡ÕèÂǡѺ Complexity of Gaussian elimination | ¤¹ºéÒ | ¤³ÔµÈÒʵÃìÍØ´ÁÈÖ¡ÉÒ | 4 | 30 ¾ÄÉÀÒ¤Á 2008 10:30 |
|
|