I have given several talks for the general public, and even more for scientific audiences. Here are slides from some of these talks. (this page is very old, will update in 2008)
| Title | Audience | Length | Description |
Biology/Bioethics/BioPhilosophy/Bio* |
|||
| Philosophy meets Biology | General public | 50 minutes | New biological problems that strain current philosophical assumptions. |
| Evolutionary Computation | |||
| Introduction to evolutionary computation | computer science students | 50 minutes | Using simulated evolution to solve problems computationally (GA, GP, etc.) |
| Using evolution to build computing software and hardware | Biologists, computer scientists, or general public | 15, 30 or 50 minutes | Evolutionary computation (EC) techniques, including genetic algorithms (GA) and genetic programming (GP), for building computer programs and computing circuits |
| EC hardness | EC researchers | 50 minutes | thoughts on how to measure problem hardness in EC. |
| Robustness of evolved circuits | EC researchers | 15 minutes | Evolved sorting networks are fail less catastrophically than hand-designed ones when subjected to point circuit failures. |
| Using GAs for building stock market portfolios | computer scientists | 50 minutes | Solving multi-objective functions (e.g. risk, return) with subtractive constraints (e.g. long and short positions), stock market portfolio example |
|
Other CS Stuff |
|||
| What machines can never learn | general public | 50 minutes | inductive inferencing: computational limits to what machines can learn |
| Pseudo randomness | computer science students | 50 minutes | Different techniques for generating pseudorandom number sequences, measuring their quality |
| DNA computing | general public | 50 minutes | Computing with DNA |
| Quantum computing | general public | 50 minutes | how to use quantum mechanics to speed up computations |
|
Other Stuff |
|||
| Doing proofs | computer science students | 50 minutes | Strategies for doing mathematical proofs |
6 June, 2008 14:17