The Design Inference: Eliminating Chance Through Small ProbabilitiesCambridge University Press, 13.9.1998 - 243 sivua This book presents a reliable method for detecting intelligent causes: the design inference.The design inference uncovers intelligent causes by isolating the key trademark of intelligent causes: specified events of small probability. Design inferences can be found in a range of scientific pursuits from forensic science to research into the origins of life to the search for extraterrestrial intelligence. This challenging and provocative book shows how incomplete undirected causes are for science and breathes new life into classical design arguments. It will be read with particular interest by philosophers of science and religion, other philosophers concerned with epistemology and logic, probability and complexity theorists, and statisticians. |
Sisältö
1Introduction | 1 |
2 Overview of the design inference | 36 |
3 Probability Theory | 67 |
4 Complexity theory | 92 |
5 Specification | 136 |
6 Small probability | 175 |
7 Epilogue | 224 |
| 231 | |
| 239 | |
Muita painoksia - Näytä kaikki
The Design Inference: Eliminating Chance through Small Probabilities William A. Dembski Rajoitettu esikatselu - 1998 |
The Design Inference: Eliminating Chance through Small Probabilities William A. Dembski Esikatselu ei käytettävissä - 2006 |
Yleiset termit ja lausekkeet
a-level actually Alice and Bob Alice's assign attribute axioms background information binary sequence Borel causal story ch(E Chance Elimination Argument chance hypothesis coin flips coin tosses coincidence collection of sentences complexity measure complexity theory computational complexity theory conditional independence cryptosystem Dawkins defined delimits Democrats denote des(E design inference detachable eliminate chance estimates of difficulty estimates of likelihood Explanatory Filter fair coin false positives flipping follows formulated GCEA given H heads hypothesis H identified improbable instance intelligent agency intractability bounds items of information journal Kolmogorov Law of Small logical lottery mathematical nonrandom occurred by chance pattern possible pow(S predicate Premise prob probabilistic resources probability measure proof random rational agents reg(E regularity rejection region relevant RMS measure satisfied saturated probability Section set of probabilistic side information simply small probability solve sp(E specification statistical stochastically independent strictly less Suppose tractability bound tractability condition universal probability bound