| 書(shū)目名稱 | Information and Randomness | | 副標(biāo)題 | An Algorithmic Persp | | 編輯 | Cristian Calude | | 視頻video | http://file.papertrans.cn/466/465945/465945.mp4 | | 叢書(shū)名稱 | Monographs in Theoretical Computer Science. An EATCS Series | | 圖書(shū)封面 |  | | 描述 | "Algorithmic information theory (AIT) is the result of putting Shannon‘s information theory and Turing‘s computability theory into a cocktail shaker and shaking vigorously", says G.J. Chaitin, one of the fathers of this theory of complexity and randomness, which is also known as Kolmogorov complexity. .It is relevant for logic (new light is shed on G?del‘s incompleteness results), physics (chaotic motion), biology (how likely is life to appear and evolve?), and metaphysics (how ordered is the universe?). .This book, benefiting from the author‘s research and teaching experience in Algorithmic Information Theory (AIT), should help to make the detailed mathematical techniques of AIT accessible to a much wider audience. | | 出版日期 | Book 19941st edition | | 關(guān)鍵詞 | Chaitin Complexity; Halting Probability; Kolmogorov complexity; Random String/Sequence; Shannon; algorith | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-662-03049-3 | | isbn_ebook | 978-3-662-03049-3Series ISSN 1431-2654 Series E-ISSN 2193-2069 | | issn_series | 1431-2654 | | copyright | Springer-Verlag Berlin Heidelberg 1994 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-2-9 23:43
發(fā)表于 2025-3-21 16:43:45
