Definition: The time required for the quantity of a chemical, drug or radioisotope to fall to half. For example, if the quantity now is 32, and half-life is 10 days, the quantity will be 16 after 10 days, 8 after 10 more days, etc.
No, but it may become useless when the situation changes
Our use of “knowledge” is a bit fuzzy – it fits somewhere in this progression.
Warning: Incompatible change!NOT a BETWEEN b AND c is parsed as NOT (a BETWEEN b AND c) rather than as (NOT a) BETWEEN b AND c
Is mathematics necessary? Moving Beyond Myths, published by the National Academy of Sciences, says so, but Prof. Dudley of DePauw University does not agree!
Given a description of an algorithm and its initial input, determine whether the algorithm, when executed on this input, ever halts (completes). The alternative is that it runs forever without halting.
Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible inputs cannot exist. We say that the halting problem is undecidable.
Turing’s formal proof is based on Turing Machine, a model of computation with a finite controller coupled to a unbounded memory
n*n determinant => n (n-1)*(n-1) determinants
Charles Babbage described his analytical engine in 1834, and in 1842-43 Lady Lovelace either created or corrected a program for it to computeBernoulli numbers(first defined in print in 1713)
(The analytical enginecould never actually be built.)
Conference: Brit. Comp. Soc., 29-31 March 2004