BSE Honours Individual Research Project by Owen Rodda, in the School of Computer Science and Software Engineering (CSSE) at Monash University, Clayton, 2003.
Suggestions and support were gratefully received from the project supervisor, A./Prof. David L. Dowe.
About the Project
Approximating Algorithmic Complexity is an attempt to produce a system for the automated generation, execution and evaluation of random C programs in order to match arbitrary target data.
A more detailed description is available in the thesis abstract.
Resources
All source code was created and tested on Macintosh OS X and should run on most Unix-based systems.
- Thesis 273kb
- PDF file containing the rendered thesis. Requires a PDF viewer such as Adobe Acrobat Reader.
- Thesis source 111kb
- Source files used to produce the PDF version. Contains LaTeX source, BibTeX references and PDF graphics. Compressed using tar and gzip.
- Server application
- Source code for the server component of the project, as described in Appendix A of the thesis. Compressed using tar and gzip.
- Client application
- Source code for the client component of the project, as described in Appendix A of the thesis. Compressed using tar and gzip.