|
|
|
|
|
|
|
In sum: This chapter has been concerned with removing the limitations imposed by fixed representations. To this end it is possible to devise languagesthe broadcast language is an examplewhich use strings to rigorously define all effectively specifiable representations, models, operators, etc. Since the objects of the language are presented as strings, they can be made grist for the mill provided by genetic plans. As a consequence the advantages of compact storage of accrued information, operational simplicity, intrinsic parallelism, robustness, etc., discussed in chapters 6 and 7, extend to adaptation of representations. |
|
|
|
|
|