Efficient Markov Chain Model of Machine Code Program Execution and Halting

We focus on the halting probability and the number of instructions executed by programs that halt for Turing-complete register based machines. The former represents the fraction of programs which provide useful results in a machine code genetic programming system. The latter determines run time and whether or not the distribution of program functionality has reached a fixed-point. We describe a Markov chain model of program execution and halting which accurately fits empirical data allowing us to efficiently estimate the halting probability and the numbers of instructions executed for programs including millions of instructions. We also discuss how this model can be applied to improve GP practice.

[1]  Riccardo Poli,et al.  The Halting Probability in Von Neumann Architectures , 2006, EuroGP.

[2]  William B. Langdon,et al.  How Many Good Programs are There? How Long are They? , 2002, FOGA.

[3]  Astro Teller,et al.  Turing completeness in the language of genetic programming with indexed memory , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[4]  Jason M. Daida,et al.  Visualizing Tree Structures in Genetic Programming , 2003, GECCO.

[5]  William B. Langdon,et al.  Convergence of Program Fitness Landscapes , 2003, GECCO.

[6]  Riccardo Poli,et al.  Using Schema Theory To Explore Interactions Of Multiple Operators , 2002, GECCO.

[7]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[8]  Riccardo Poli,et al.  On Turing complete T7 and MISC F--4 program fitnes landscapes , 2005, Theory of Evolutionary Algorithms.

[9]  Sidney R. Maxwell,et al.  Experiments with a coroutine execution model for genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[10]  Jonathan E. Rowe,et al.  A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover , 2005, FOGA.

[11]  Justinian Rosca,et al.  A PROBABILISTIC MODEL OF SIZE DRIFT , 2003 .

[12]  William B. Langdon,et al.  Convergence Rates For The Distribution Of Program Outputs , 2002, GECCO.

[13]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[14]  David E. Goldberg,et al.  BUILDING-BLOCK SUPPLY IN GENETIC PROGRAMMING , 2003 .