1. I think the text really could use a lot more examples. And running demonstrations. Maybe for the next iteration.
2. Real code is nontrivial given the scope of the text -- but it'll please you that about two thirds of the algorithms in the text are implemented in ECJ, an evolutionary computation system I wrote which is fairly widely used. In Java though, not in Haskell. :-) I'm working towards getting everything implemented eventually.
I'm surprised about your comment regarding pseudocode: I took a lot of pains to make the pseudocode as easy for laymen and undergrads to understand and I think it's proven pretty good in that aspect.
3. Exercises are not easy to devise in this area due to the stochastic nature of the algorithms. It is a real problem.
4. Yeah, the name took a long time and a lot of thought and not just by me. There are a lot of difficulties with the names you suggested -- in fact one of the early footnotes in the text discusses exactly this issue! It doesn't google well though.
1. I think the text really could use a lot more examples. And running demonstrations. Maybe for the next iteration.
2. Real code is nontrivial given the scope of the text -- but it'll please you that about two thirds of the algorithms in the text are implemented in ECJ, an evolutionary computation system I wrote which is fairly widely used. In Java though, not in Haskell. :-) I'm working towards getting everything implemented eventually.
I'm surprised about your comment regarding pseudocode: I took a lot of pains to make the pseudocode as easy for laymen and undergrads to understand and I think it's proven pretty good in that aspect.
3. Exercises are not easy to devise in this area due to the stochastic nature of the algorithms. It is a real problem.
4. Yeah, the name took a long time and a lot of thought and not just by me. There are a lot of difficulties with the names you suggested -- in fact one of the early footnotes in the text discusses exactly this issue! It doesn't google well though.