How to Treat Evolutionary Algorithms as Ordinary Randomized Algorithms

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=P6JcK8VCDhk


Duration: 51:58
266 views
1

Carsten Witt, Technical University of Denmark
Computational Theories of Evolution
http://simons.berkeley.edu/talks/carsten-witt-2014-03-19



Other Videos By Simons Institute for the Theory of Computing


2014-03-27Satisfiability and Evolution
2014-03-27The Adaptive Immune System as a Learning Algorithm
2014-03-27Evolution in Fluctuating Environments
2014-03-27The Rate of Progress of Evolution
2014-03-27Algorithms for Multityped Branching Processes
2014-03-27The Blessing and the Curse of Multiplicative Updates
2014-03-27Presentation of Evolvability
2014-03-27Generalization of the Central Models of Evolutionary Biology in the (post)Genomic Era
2014-03-27A New Research Program: Evolutionary Neurodynamics
2014-03-27Measurement Scale and the Dissipation of Information Shape Biological Pattern
2014-03-27How to Treat Evolutionary Algorithms as Ordinary Randomized Algorithms
2014-03-27Evolution of Dynamic Models for Embryonic Patterning and Their Geometric Representation
2014-03-27Birth and Death of Fragile Chromosomal Regions in Mammalian Evolution
2014-03-27Variation in Regulatory Information Within and Between Species
2014-03-27Interaction-based Evolution: How Natural Selection and Non-accidental Mutation Work Together
2014-03-27What Limits the Efficiency of Natural Selection?
2014-03-27Presentation of Evolution and Algorithms
2014-03-27The Evolution of Evolvability
2014-03-27Molecular Errors, Cryptic Sequences, and Evolvability
2014-03-27Presentation of Evolvability
2014-03-20Quantum Hamiltonian Complexity


Tags:
Simons Institute
Evolutionary Biology
UC Berkeley
computer science
theory of computing
Carsten Witt