Algorithmic information theory
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Βιβλίο |
| Γλώσσα: | English |
| Δημοσίευση: |
Cambridge [Cambridgeshire] : New York :
Cambridge University Press,
1987
|
| Σειρά: | Cambridge tracts in theoretical computer science ;
; 1 |
| Θέματα: | |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 1/37519 | ||
| 008 | 941103s1987 eng d | ||
| 020 | |a 0521343062 | ||
| 035 | |l 10040531 | ||
| 035 | |a 1995 |c ΔΑΡΖΕΝΤΑΣ | ||
| 040 | |a GR-MY-UA |b gre |e aacr | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 004 |2 (19) | |
| 100 | 1 | |a Chaitin, Gregory J. | |
| 245 | 1 | 0 | |a Algorithmic information theory / |c Gregory J. Chaitin |
| 260 | |a Cambridge [Cambridgeshire] : |a New York : |b Cambridge University Press, |c 1987 | ||
| 300 | |a x, 175 p.; |c 25 cm | ||
| 490 | 1 | |a Cambridge tracts in theoretical computer science |v ; 1 | |
| 504 | |a Bibliography: p. [173]-175 | ||
| 650 | 0 | 0 | |a Machine theory. |
| 650 | 0 | 0 | |a Computational complexity. |
| 650 | 0 | 0 | |a LISP (Computer program language) |
| 650 | 0 | 0 | |a Computer programming. |
| 650 | 0 | 0 | |a Algorithms. |
| 650 | 0 | 0 | |a Mathematics. |
| 650 | 0 | 0 | |a Incompleteness theorems. |
| 830 | 0 | |a Cambridge tracts in theoretical computer science ; |v ; 1 | |
| 852 | |a INST |b SAMOS |e 19941103 |h 004 CHA |p 005300002553 |q 005300002553 |t BK |y 0 | ||
| 852 | |a INST |b SAMOS |e 19941103 |h 004 CHA |p 005300003728 |q 005300003728 |t BK |y 0 | ||
| 909 | |a Σ |b 017080 | ||
| 909 | |a Σ |b 029680 | ||