Bemærk: Kan ikke leveres før jul.
Forventes på lager: 02-12-2004
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.
| Forlag | Cambridge University Press |
| Forfatter | Gregory J. Chaitin |
| Type | Bog |
| Format | Paperback / softback |
| Sprog | Engelsk |
| Udgivelsesdato | 02-12-2004 |
| Første udgivelsesår | 2004 |
| Serie | Cambridge Tracts in Theoretical Computer Science |
| Illustrationer | Worked examples or Exercises |
| Originalsprog | United Kingdom |
| Sideantal | 192 |
| Indbinding | Paperback / softback |
| Forlag | Cambridge University Press |
| Serieredaktør | C. J. Van Rijsbergen, S. Abramsky, P. H. Aczel, J. W. de Bakker, Y. Gurevich, J. V. Tucker |
| Sideoplysninger | 192 pages, Worked examples or Exercises |
| Mål | 189 x 247 x 11 |
| ISBN-13 / EAN-13 | 9780521616041 |