Povej prijatelju o tem izdelku:
Algorithmic Information Theory - Cambridge Tracts in Theoretical Computer Science Gregory. J. Chaitin
Algorithmic Information Theory - Cambridge Tracts in Theoretical Computer Science
Gregory. J. Chaitin
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs.
192 pages, black & white illustrations
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 2. decembra 2004 |
| ISBN13 | 9780521616041 |
| Založniki | Cambridge University Press |
| Strani | 192 |
| Dimenzije | 247 × 189 × 11 mm · 364 g |
| Jezik | Angleščina |
| Urednik serije | Abramsky, S. |
| Urednik serije | Aczel, P. H. |
| Urednik serije | Bakker, J. W. de |
| Urednik serije | Gurevich, Y. |
| Urednik serije | Tucker, J. V. |
| Urednik serije | Van Rijsbergen, C. J. |