probability of accepting a false hypothesis
21Ockham’s world and future — Arthur Gibson PHILOSOPHICAL BIOGRAPHY Ockham was born in about 1285, certainly before 1290, probably in the village of Ockham, Surrey, near London. If his epitaph is accurate, he died on 10 April 1347. Yet Conrad of Megenberg, when writing to… …
22Fine-tuned Universe — The fine tuned Universe is the idea that the conditions that allow life in the Universe can only occur when certain universal physical constants lie within a very narrow range, so that if any of several fundamental constants were only slightly… …
23chemical element — Introduction also called element, any substance that cannot be decomposed into simpler substances by ordinary chemical processes. Elements are the fundamental materials of which all matter is composed. This article considers the… …
24William A. Dembski — Born July 18, 1960 (1960 07 18) (age 51) Chicago, Illinois Education University of Illinoi …
25Argument from ignorance — The argument from ignorance, also known as argumentum ad ignorantiam ( appeal to ignorance [ [http://philosophy.lander.edu/logic/ignorance.html Argumentum ad Ignorantiam ] ] ) or argument by lack of imagination, is a logical fallacy in which it… …
26Amelia Earhart — Earhart redirects here. For the asteroid, see 3895 Earhart. Amelia Earhart Amelia Earhart …
27History of creationism — The history of creationism is tied to the history of religions. The term creationism in its broad sense covers a wide range of beliefs and interpretations, and was not in common use before the late 19th century. Following the spread of… …
28Cold fusion — This article is about the Fleischmann–Pons claims of nuclear fusion at room temperature. For the original use of the term cold fusion , see Muon catalyzed fusion. For all other definitions, see Cold fusion (disambiguation). Diagram of an open… …
29Problem of evil — Part of a series on God General conceptions …
30Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …
