Algorithmic information theory / Gregory J. Chaitin.
Saved in:
Personal Name(s): | Chaitin, G. J. |
---|---|
Imprint: |
Cambridge :
Cambridge University Pr.,
1987.
|
Physical Description: |
X, 178 S. |
Note: |
englisch |
ISBN: |
9780521343060 0521343062 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Cambridge tracts in theoretical computer science ;
1. |
Subject (ZB): | |
Classification: | |
Shelf Classification: |
LEADER | 01019cam a2200289 n 4500 | ||
---|---|---|---|
001 | 126622 | ||
005 | 20040928081900.0 | ||
008 | r1987 | ||
020 | |a 0521343062 | ||
035 | |a (Sirsi) a112556 | ||
084 | 0 | |a MDE - Decidability, calculability, enumerability |2 ZB | |
084 | 0 | |a MDG - Automata theory |2 ZB | |
084 | 0 | |a MEAC - Diophantine equations, diophantine approximations |2 ZB | |
084 | 1 | |a MDG - Theorie der Automaten |2 LS | |
245 | 0 | 0 | |a Algorithmic information theory / |c Gregory J. Chaitin. |
260 | |a Cambridge : |b Cambridge University Pr., |c 1987. | ||
300 | |a X, 178 S. | ||
490 | 0 | |a Cambridge tracts in theoretical computer science ; |v 1. | |
500 | |a englisch | ||
596 | |a 1 | ||
650 | 4 | |a algorithm theory | |
650 | 4 | |a LISP [programming language] | |
700 | 1 | |a Chaitin, G. J. | |
900 | |a S 006321-0001'01' | ||
900 | |a MDG 002 | ||
908 | |a Monographie, Sammelwerk | ||
949 | |a MDG 002 |w LC |c 1 |i 1089101448 |d 28/9/2004 |e 31/7/1998 |l STACKS |m ZB |n 1 |r Y |s Y |t ZBB |u 25/3/2009 |x ZB-D |1 PRINT |