https://en.wikipedia.org/wiki/W._D._Hamilton
QT:{{”
Hamilton became famous through his theoretical work expounding a rigorous genetic basis for the existence of altruism, an insight that was a key part of the development of the gene-centered view of evolution. He is considered one of the forerunners of sociobiology. Hamilton also published important work on sex ratios and the evolution of sex. From 1984 to his death in 2000, he was a Royal Society Research Professor at Oxford University.
“}}
https://en.wikipedia.org/wiki/John_Maynard_Smith
QT:{{”
John Maynard Smith[a] FRS (6 January 1920 – 19 April 2004) was a British theoretical and mathematical evolutionary biologist and geneticist.[1] Originally an aeronautical engineer during the Second World War, he took a second degree in genetics under the well-known biologist J. B. S. Haldane. Maynard Smith was instrumental in the application of game theory to evolution with George R. Price, and theorised on other problems such as the evolution of sex and signalling theory.
“}}
https://en.wikipedia.org/wiki/Minimax
QT:{{”
One iteration of the middle-square method, showing a 6-digit seed, which is then squared, and the resulting value has its middle 6 digits as the output value (and also as the next seed for the sequence). “}}
https://en.wikipedia.org/wiki/Middle-square_method
QT:{{”
One iteration of the middle-square method, showing a 6-digit seed, which is then squared, and the resulting value has its middle 6 digits as the output value (and also as the next seed for the sequence). “}}
https://en.wikipedia.org/wiki/Entscheidungsproblem
QT:{{”
By the completeness theorem of first-order logic, a statement is universally valid if and only if it can be deduced from the axioms, so the Entscheidungsproblem can also be viewed as asking for an algorithm to decide whether a given statement is provable from the axioms using the rules of logic. In 1936, Alonzo Church and Alan Turing published independent papers[2] showing that a general solution to the Entscheidungsproblem is impossible, assuming that the intuitive notion of “effectively calculable” is captured by the functions computable by a Turing machine (or equivalently, by those expressible in the lambda calculus). This assumption is now known as the Church–Turing thesis. “}}
linkstream2 microblog 