Abstract
This paper describes a novel general method for automatic programming which can be seen as a generalization of techniques such as genetic programming and ADATE. The approach builds on the assumption that data compression can be used as a metaphor for cognition and intelligence. The proof-of-concept system is evaluated on sequence prediction problems. As a starting point, the process of inferring a general law from a data set is viewed as an attempt to compress the observed data. From an artificial intelligence point of view, compression is a useful way of measuring how deeply the observed data is understood. If the sequence contains redundancy it exists a shorter description i.e. the sequence can be compressed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shannon, C.E.: A Mathematical Theory of Communication The Bell System Technical Journal Vol. 27, (1948) pp. 13
Solomonoff, R., J.: A preliminary report on a general theory of inductive inference. (1960) pp. 11–14
Vitányi, P., Li, M.: Simplicity, Information, Kolmogorov Complexity, and Prediction. (1998) pp. 3
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galos, P., Nordin, P., Olsén, J., Ringnér, K.S. (2003). A General Approach to Automatic Programming Using Occam’s Razor, Compression, and Self-Inspection. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_74
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive