Big Books of Spring

Find Quotes


Results for "turing complex adaptive" Showing 1-2 of 2 (0.11 seconds)

George Dyson
“Instead of focusing upon natural mechanisms that were microscopic and highly complex, Barricelli sought to introduce primitive self-reproducing entities into an empty universe where they could be directly observed. “The Darwinian idea that evolution takes place by random hereditary changes and selection has from the beginning been handicapped by the fact that no proper test had been found to decide whether such evolution was possible and how it would develop under controlled conditions,” he wrote. “A test using living organisms in rapid evolution (viruses or bacteria) would have the serious drawback that the causes of adaptation or evolution would be difficult to state unequivocally, and Lamarckian or other kinds of interpretation would be difficult to exclude.” We now know that lateral gene transfer and other non-neo-Darwinian mechanisms are far more prevalent, especially in microbiology, than was evident in 1953.”
― George B. Dyson, Turing's Cathedral: The Origins of the Digital Universe
0 likes
Like

“Later Turing proved that Turing machines could compute exactly the same functions as lambda calculus, which proved that all three models of computation are equivalent. This is a truly remarkable result, considering how different the three models of computation are. In Church's 1941 paper he made a statement that is now known as the Church-Turing thesis: Any function that can be called computable can be computed by lambda calculus, a Turing machine, or a general recursive function.

Recall the point that was made about functions describing relationships between numbers and models of computation describing functions. Well, the Church-Turing thesis is yet another level more fundamental than a model of computation. As a statement about models of computation, it is not subject to proof in the usual sense; thus, it is impossible to prove that the thesis is correct. Once could disprove it by coming up with a model of computation over discrete elements that could calculate things that one of the other models could not; however, this has not happened. The fact that every posed model of computation has always been exactly equivalent to (or weaker than) one of the others lends strong support to the Church-Turing thesis.”
― Gary William Flake, The Computational Beauty of Nature: Computer Explorations of Fractals, Chaos, Complex Systems, and Adaptation
0 likes
Like


All Quotes | My Quotes | Add A Quote

Browse By Tag