Evolvability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4708 LNCS, Issue , 2007, Pages 22-43

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; LEARNING SYSTEMS; POPULATION DYNAMICS; RANDOM PROCESSES;

BOOLEAN CONJUNCTIONS; COMPUTATIONAL LEARNING; EVOLUTIONARY THEORY; POPULATION SIZES; REALISTIC TIME PERIODS;

LIVING SYSTEMS STUDIES;

EID: 38049003107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74456-6_5     Document Type: Conference Paper

References (28)

1. Bäck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Oxford Univ. Press, Oxford (1997)
2. Bejerano, G., et al.: Ultraconserved elements in the human genome. Science 304, 1321-1325 (2004)
3. Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik Chervonenkis dimension. J. ACM 36(4), 929-965 (1989)
4. Bürger, R.: The Mathematical Theory of Selection, Recombination, and Mutation. Wiley, Chichester (2000)
5. Darwin, C.: On the origin of species by means of natural selection. John Murray, London (1859)
6. Dermitzakis, E.T., et al.: Conserved non-genic sequences - an unexpected feature of mammalian genomes. Nature Reviews Genetics 6, 151-157 (2005)
7. Drake, J.W., et al.: Rates of spontaneous mutation. Genetics 148, 1667-1686 (1998)
8. Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.G.: A general lower bound on the number of examples needed for learning. Inf. and Computation 82(2), 247-261 (1989)
9. Fischer, P., Simon, H.U.: On learning ring-sum expressions. SIAM J. Computing 21(1), 181-192 (1992)
10. Fisher, R.A.: The Genetical Theory of Natural Selection. Oxford University Press, Oxford (1930)
11. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
12. Helmbold, D., Sloan, R., Warmuth, M.K.: Learning integer lattices. SIAM J. Computing 21(2), 240-266 (1992)
13. Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc. 58, 13 (1963)
14. Kearns, M.: Efficient noise tolerant learning from statistical queries. JACM 45(6), 983-1006 (1998)
15. Kearns, M., Valiant, L.G.: Cryptographic limitations on learning Boolean formulae. J. ACM 41(1), 67-95 (1994)
16. Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)
17. Kimura, M.: Evolutionary rate at the molecular level. Nature 217, 624-626 (1968)
18. Kumar, S., Subramanian, S.: Mutation rates in mammalian genomes. Proc. Nat. Acad. Sci. 99, 803-808 (2002)
19. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading, Mass (1994)
20. Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM 35(4), 965-984 (1988)
21. Roff, D.A.: Evolutionary Quantitative Genetics. Chapman & Hall, New York (1997)
22. Ros, J.P.: Learning Boolean functions with genetic algorithms: A PAC analysis. In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms, pp. 257-275. Morgan Kaufmann, San Mateo, CA (1993)
23. Valiant, L.G.: A theory of the learnable. C. ACM 27(11), 1134-1142 (1984)
24. Valiant, L.G.: Robust logics. Artificial Intelligence Journal 117, 231-253 (2000)
25. Valiant, L.G.: Knowledge infusion. In: Proc. 21st National Conference on Artificial Intelligence, AAAI06, pp. 1546-1551 (2006)
26. Wagner, G.P., Altenberg, L.: Complex adaptations and the evolution of evolvability. Evolution 50(3), 967-976 (1996)
27. Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 64-78. Springer, Heidelberg (2001)
28. Wright, S.: Evolution and the Genetics of Populations, A Treatise. University of Chicago Press, Chicago (1968-78)