Algorithmic information theory:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
Cambridge <<[u.a.]>>
Cambridge Univ. Pr.
1987
|
Schriftenreihe: | Cambridge tracts in theoretical computer science
1 |
Schlagworte: | |
Beschreibung: | X, 175 S. Ill. |
ISBN: | 0521343062 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV024631755 | ||
003 | DE-604 | ||
005 | 20090910 | ||
007 | t | ||
008 | 090924s1987 a||| |||| 00||| und d | ||
020 | |a 0521343062 |9 0-521-34306-2 | ||
035 | |a (OCoLC)230913021 | ||
035 | |a (DE-599)BVBBV024631755 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | |a und | ||
049 | |a DE-83 | ||
084 | |a CC 2600 |0 (DE-625)17610: |2 rvk | ||
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
100 | 1 | |a Chaitin, Gregory J. |d 1947- |e Verfasser |0 (DE-588)121658600 |4 aut | |
245 | 1 | 0 | |a Algorithmic information theory |
264 | 1 | |a Cambridge <<[u.a.]>> |b Cambridge Univ. Pr. |c 1987 | |
300 | |a X, 175 S. |b Ill. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Cambridge tracts in theoretical computer science |v 1 | |
650 | 0 | 7 | |a Wahrscheinlichkeitstheorie |0 (DE-588)4079013-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Informationstheorie |0 (DE-588)4026927-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a LISP |0 (DE-588)4035918-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Gödelscher Unvollständigkeitssatz |0 (DE-588)4021417-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Metamathematik |0 (DE-588)4074759-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Gödelscher Unvollständigkeitssatz |0 (DE-588)4021417-5 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Metamathematik |0 (DE-588)4074759-1 |D s |
689 | 2 | 1 | |a LISP |0 (DE-588)4035918-9 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Informationstheorie |0 (DE-588)4026927-9 |D s |
689 | 3 | 1 | |a Wahrscheinlichkeitstheorie |0 (DE-588)4079013-7 |D s |
689 | 3 | |5 DE-604 | |
830 | 0 | |a Cambridge tracts in theoretical computer science |v 1 |w (DE-604)BV000754528 |9 1 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-018044145 |
Datensatz im Suchindex
_version_ | 1804140046751629312 |
---|---|
any_adam_object | |
author | Chaitin, Gregory J. 1947- |
author_GND | (DE-588)121658600 |
author_facet | Chaitin, Gregory J. 1947- |
author_role | aut |
author_sort | Chaitin, Gregory J. 1947- |
author_variant | g j c gj gjc |
building | Verbundindex |
bvnumber | BV024631755 |
classification_rvk | CC 2600 SK 130 |
ctrlnum | (OCoLC)230913021 (DE-599)BVBBV024631755 |
discipline | Mathematik Philosophie |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01931nam a2200517 cb4500</leader><controlfield tag="001">BV024631755</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1987 a||| |||| 00||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521343062</subfield><subfield code="9">0-521-34306-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)230913021</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024631755</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 2600</subfield><subfield code="0">(DE-625)17610:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaitin, Gregory J.</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121658600</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic information theory</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge <<[u.a.]>></subfield><subfield code="b">Cambridge Univ. Pr.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 175 S.</subfield><subfield code="b">Ill.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">1</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4079013-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">LISP</subfield><subfield code="0">(DE-588)4035918-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gödelscher Unvollständigkeitssatz</subfield><subfield code="0">(DE-588)4021417-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Metamathematik</subfield><subfield code="0">(DE-588)4074759-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Gödelscher Unvollständigkeitssatz</subfield><subfield code="0">(DE-588)4021417-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Metamathematik</subfield><subfield code="0">(DE-588)4074759-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">LISP</subfield><subfield code="0">(DE-588)4035918-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4079013-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV000754528</subfield><subfield code="9">1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018044145</subfield></datafield></record></collection> |
id | DE-604.BV024631755 |
illustrated | Illustrated |
indexdate | 2024-07-09T21:53:45Z |
institution | BVB |
isbn | 0521343062 |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018044145 |
oclc_num | 230913021 |
open_access_boolean | |
owner | DE-83 |
owner_facet | DE-83 |
physical | X, 175 S. Ill. |
publishDate | 1987 |
publishDateSearch | 1987 |
publishDateSort | 1987 |
publisher | Cambridge Univ. Pr. |
record_format | marc |
series | Cambridge tracts in theoretical computer science |
series2 | Cambridge tracts in theoretical computer science |
spelling | Chaitin, Gregory J. 1947- Verfasser (DE-588)121658600 aut Algorithmic information theory Cambridge <<[u.a.]>> Cambridge Univ. Pr. 1987 X, 175 S. Ill. txt rdacontent n rdamedia nc rdacarrier Cambridge tracts in theoretical computer science 1 Wahrscheinlichkeitstheorie (DE-588)4079013-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Informationstheorie (DE-588)4026927-9 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf LISP (DE-588)4035918-9 gnd rswk-swf Gödelscher Unvollständigkeitssatz (DE-588)4021417-5 gnd rswk-swf Metamathematik (DE-588)4074759-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Informatik (DE-588)4026894-9 s DE-604 Gödelscher Unvollständigkeitssatz (DE-588)4021417-5 s Metamathematik (DE-588)4074759-1 s LISP (DE-588)4035918-9 s Informationstheorie (DE-588)4026927-9 s Wahrscheinlichkeitstheorie (DE-588)4079013-7 s Cambridge tracts in theoretical computer science 1 (DE-604)BV000754528 1 |
spellingShingle | Chaitin, Gregory J. 1947- Algorithmic information theory Cambridge tracts in theoretical computer science Wahrscheinlichkeitstheorie (DE-588)4079013-7 gnd Algorithmus (DE-588)4001183-5 gnd Informationstheorie (DE-588)4026927-9 gnd Informatik (DE-588)4026894-9 gnd LISP (DE-588)4035918-9 gnd Gödelscher Unvollständigkeitssatz (DE-588)4021417-5 gnd Metamathematik (DE-588)4074759-1 gnd |
subject_GND | (DE-588)4079013-7 (DE-588)4001183-5 (DE-588)4026927-9 (DE-588)4026894-9 (DE-588)4035918-9 (DE-588)4021417-5 (DE-588)4074759-1 |
title | Algorithmic information theory |
title_auth | Algorithmic information theory |
title_exact_search | Algorithmic information theory |
title_full | Algorithmic information theory |
title_fullStr | Algorithmic information theory |
title_full_unstemmed | Algorithmic information theory |
title_short | Algorithmic information theory |
title_sort | algorithmic information theory |
topic | Wahrscheinlichkeitstheorie (DE-588)4079013-7 gnd Algorithmus (DE-588)4001183-5 gnd Informationstheorie (DE-588)4026927-9 gnd Informatik (DE-588)4026894-9 gnd LISP (DE-588)4035918-9 gnd Gödelscher Unvollständigkeitssatz (DE-588)4021417-5 gnd Metamathematik (DE-588)4074759-1 gnd |
topic_facet | Wahrscheinlichkeitstheorie Algorithmus Informationstheorie Informatik LISP Gödelscher Unvollständigkeitssatz Metamathematik |
volume_link | (DE-604)BV000754528 |
work_keys_str_mv | AT chaitingregoryj algorithmicinformationtheory |