Forrest one describes an algorithm as an evolutionary process. It starts with a population of possible solutions and repeatedly evaluates, selects and modifies them. The goal is to improve the solutions through fitness, mutation and crossover.
Moseley describes algorithms through musical dice games. Instead of improving, the algorithm follows instructions to combine musical fragments into new compositions. Randomness determines which elements are selected, while the rules ensure that the resulting music maintains somewhat of a structure.
I am interested in both approaches because they demonstrate how simple rules can produce outcomes that are more complex than what the designer initially specifies. I find genetic algorithms interesting because they allow solutions to evolve rather than requiring someone to manually define every step toward the final result. But if I have to choose (which I don't) Moseley's discussion of musical dice games makes generative algorithms feel more accessible and creative. I like the idea that an algorithm does not have to be designed solely to solve a problem; it can also be used as a tool for experimentation and artistic purposes. Also, the player is not just observing the output but actively participating in the process. This makes me think about how generative systems can provide a framework for creativity without completely taking control away from the person using them, which is what makes arts art.
Yes. I think I could explain both approaches using relatively simple examples.
For genetic algorithms, I would compare the process to a population of candidates competing to solve a problem. The better candidates have more opportunities to pass their "genes" to the next generation, while mutation and crossover introduce new possibilities. Over time, the population can develop better solutions.
For Moseley's musical dice games, I think he did a good job of explaining it as simple as it could be, so I would do the same thing.