Search (2 results, page 1 of 1)
-
×
subject_ss:"Computational complexity"
- Did you mean:
- rswk_00%3a%22World wide web %2f elektronische bibliothek %2f information retrieval %2f kongress %2f trondheim %3.2003%3E%22 2
- rswk_00%3a%22World wide web %2f elektronische bibliothek %2f information retrieval %2f kongress %2f trondheim %32003%3E%22 2
- rswk_00%3a%22World wide web %2f elektronische bibliothek %2f information retrieval %2f kongresse %2f trondheim %3.2003%3E%22 2
- rswk_00%3a%22World wide web %2f elektronische bibliothek %2f information retrieval %2f kongress %2f trondheim %3.2008%3E%22 2
- rswk_00%3a%22World wide web %2f elektronische bibliothek %2f information retrieval %2f kongresu %2f trondheim %3.2003%3E%22 2
-
Chaitin, G.J.: Algorithmic information theory (1987)
0.00
8.64828E-4 = product of: 0.012107591 = sum of: 0.012107591 = weight(_text_:information in 4175) [ClassicSimilarity], result of: 0.012107591 = score(doc=4175,freq=8.0), product of: 0.052020688 = queryWeight, product of: 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.029633347 = queryNorm 0.23274569 = fieldWeight in 4175, product of: 2.828427 = tf(freq=8.0), with freq of: 8.0 = termFreq=8.0 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.046875 = fieldNorm(doc=4175) 0.071428575 = coord(1/14)
- Abstract
- 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. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
- Theme
- Information
-
Wolfram, S.: ¬A new kind of science (2002)
0.00
3.5672335E-4 = product of: 0.0049941265 = sum of: 0.0049941265 = weight(_text_:information in 1866) [ClassicSimilarity], result of: 0.0049941265 = score(doc=1866,freq=4.0), product of: 0.052020688 = queryWeight, product of: 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.029633347 = queryNorm 0.0960027 = fieldWeight in 1866, product of: 2.0 = tf(freq=4.0), with freq of: 4.0 = termFreq=4.0 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.02734375 = fieldNorm(doc=1866) 0.071428575 = coord(1/14)
- BK
- 85.20 (Betriebliche Information und Kommunikation)
- Classification
- 85.20 (Betriebliche Information und Kommunikation)
Authors
Subjects
- Algorithmus / Informatik 1
- Cellular automata 1
- Gödelscher Unvollständigkeitssatz 1
- LISP (Computer program language) 1
- Machine theory 1
- Metamathematik / LISP 1
- Wissenschaftstheorie / Zellularer Automat / Berechnungskomplexität 1
- Zellularer Automat / Komplexitätstheorie / Naturwissenschaften 1
- More… Less…
Classifications
- SK 130 2
- 006.31 1
- 30.02 (Philosophie und Theorie der Naturwissenschaften) 1
- 30.20 (Nichtlineare Dynamik) 1
- 31.02 (Philosophie und Wissenschaftstheorie der Mathematik) 1
- 31.14 (Zahlentheorie) 1
- 500 1
- 54.10 (Theoretische Informatik) 1
- 54.73 (Computergraphik) 1
- 85.20 (Betriebliche Information und Kommunikation) 1
- CC 3200 1
- Mat T 1068 / Informationstheorie 1
- QA267 1
- QA267.5.C45 1
- ST 130 1
- ST 134 1
- TUI (FH K) 1
- TVB (E) 1
- TVH (DU) 1
- TVI (HA) 1
- TVM (W) 1
- UB 5020 1
- More… Less…