proof machine
101NEXPTIME — In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non deterministic Turing machine using time O(2p(n)) for some polynomial p(n), and unlimited space.… …
102List of Edison patents — Below is a list of Edison patents. Thomas Edison was an inventor who, it is said, accumulated 1500 plus patents worldwide for his inventions. Nearly 1100 of Edison s patents were in the United States, but other patents were approved in countries… …
103Renewal theory — is the branch of probability theory that generalizes Poisson processes for arbitrary holding times . Applications include calculating the expected time for a monkey who is randomly tapping at a keyboard to type the word Macbeth and comparing the… …
104Logic Theorist — is a computer program written in 1955 and 1956 by Alan Newell, Herbert Simon and J. C. Shaw. It was the first program deliberately engineered to mimic the problem solving skills of a human being and is called the first artificial intelligence… …
105Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… …
106Descartes: metaphysics and the philosophy of mind — John Cottingham THE CARTESIAN PROJECT Descartes is rightly regarded as one of the inaugurators of the modern age, and there is no doubt that his thought profoundly altered the course of Western philosophy. In no area has this influence been more… …
107Occam's razor — For the aerial theatre company, see Ockham s Razor Theatre Company. It is possible to describe the other planets in the solar system as revolving around the Earth, but that explanation is unnecessarily complex compared to the modern consensus… …
108Collatz conjecture — Directed graph showing the orbits of small numbers under the Collatz map. The Collatz conjecture is equivalent to the statement that all paths eventually lead to 1 …
109Shell (projectile) — This article is about the artillery projectile. For the small arms ammunition, see Shotgun shell. Some sectioned shells from the First World War. From left to right: 90 mm fragmentation shell, 120 mm pig iron incendiary shell, 77/14 model 75 mm… …
110Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… …
