Search (2 results, page 1 of 1)
-
×
subject_ss:"Computational complexity"
- Did you mean:
- object_ss:"viele "jana und halting"" 2
- object_ss:"viele "java und haltung"" 2
- object_ss:"viele "jama und halting"" 2
- object_ss:"viele "jana und haltung"" 2
- object_ss:"viele "java und halling"" 2
-
Chaitin, G.J.: Algorithmic information theory (1987)
0.33
0.33427528 = product of: 0.66855055 = sum of: 0.026079249 = weight(_text_:und in 175) [ClassicSimilarity], result of: 0.026079249 = score(doc=175,freq=4.0), product of: 0.1254244 = queryWeight, product of: 2.217899 = idf(docFreq=13141, maxDocs=44421) 0.056551 = queryNorm 0.20792803 = fieldWeight in 175, product of: 2.0 = tf(freq=4.0), with freq of: 4.0 = termFreq=4.0 2.217899 = idf(docFreq=13141, maxDocs=44421) 0.046875 = fieldNorm(doc=175) 0.6424713 = weight(_text_:halting in 175) [ClassicSimilarity], result of: 0.6424713 = score(doc=175,freq=4.0), product of: 0.62253153 = queryWeight, product of: 11.008321 = idf(docFreq=1, maxDocs=44421) 0.056551 = queryNorm 1.0320301 = fieldWeight in 175, product of: 2.0 = tf(freq=4.0), with freq of: 4.0 = termFreq=4.0 11.008321 = idf(docFreq=1, maxDocs=44421) 0.046875 = fieldNorm(doc=175) 0.5 = coord(2/4)
- 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.
- BK
- 31.02 (Philosophie und Wissenschaftstheorie der Mathematik)
- Classification
- 31.02 (Philosophie und Wissenschaftstheorie der Mathematik)
-
Wolfram, S.: ¬A new kind of science (2002)
0.01
0.0053785704 = product of: 0.021514282 = sum of: 0.021514282 = weight(_text_:und in 2866) [ClassicSimilarity], result of: 0.021514282 = score(doc=2866,freq=8.0), product of: 0.1254244 = queryWeight, product of: 2.217899 = idf(docFreq=13141, maxDocs=44421) 0.056551 = queryNorm 0.17153187 = fieldWeight in 2866, product of: 2.828427 = tf(freq=8.0), with freq of: 8.0 = termFreq=8.0 2.217899 = idf(docFreq=13141, maxDocs=44421) 0.02734375 = fieldNorm(doc=2866) 0.25 = coord(1/4)
- BK
- 85.20 (Betriebliche Information und Kommunikation)
30.02 (Philosophie und Theorie der Naturwissenschaften) - Classification
- 85.20 (Betriebliche Information und Kommunikation)
30.02 (Philosophie und Theorie der Naturwissenschaften)
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…