The halting probability in Von Neumann architectures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3905 LNCS, Issue , 2006, Pages 225-237

  Langdon, W B ^a   Poli, R ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

FITNESS LANDSCAPES; HALTING PROBABILITY; LINEAR GENETIC PROGRAMMING; VON NEUMANN ARCHITECTURES;

PROBABILISTIC LOGICS;

EID: 33745744352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11729976_20     Document Type: Conference Paper

References (16)

1. W. B. Langdon and R. Poli. Foundations of Genetic Programming. 2002.
2. N. F. McPhee and R. Poli. Using schema theory to explore interactions of multiple operators. In W. B. Langdon, et al., eds., GECCO 2002, pp853-860.
3. J. Rosca. A probabilistic model of size drift. In R. L. Riolo and B. Worzel, eds., Genetic Programming Theory and Practice, pp119-136. Kluwer, 2003.
4. K. Sastry, U-M O'Reilly, D. E. Goldberg and D. Hill. Building block supply GP. In Genetic Programming Theory and Practice, pp137-154. Kluwer, 2003.
5. B. Mitavskiy and J. E. Rowe. A schema-based version of Geiringer's theorem for nonlinear genetic programming with homologous crossover. In A. H. Wright, et al., eds., Foundations of Genetic Algorithms 8, LNCS 3469, pp156-175. 2005.
6. J. M. Daida, A. M. Hilss, D. J. Ward, and S. L. Long. Visualizing tree structures in genetic programming. Genetic Programming and Evolvable Machines, 6(1):79-110
7. W. B. Langdon. Convergence rates for the distribution of program outputs. In W. B. Langdon, et al., eds., GECCO 2002, pp812-819, New York, 9-13 July 2002.
8. W. B. Langdon. How many good programs are there? How long are they? In K. A. De Jong, et al., eds., FOGA 7, pp183-202, Morgan Kaufmann. Published 2003.
9. W. B. Langdon. The distribution of reversible functions is Normal. In Genetic Programming Theory and Practise, pp173-188. Kluwer, 2003.
10. W. B. Langdon. Convergence of program fitness landscapes. In E. Cantú-Paz, et al., eds., GECCO 2003, LNCS 2724, pp1702-1714. Springer-Verlag.
11. A. Teller. Turing completeness in the language of GP with indexed memory. In 1994 IEEE World Congress on Computational Intelligence, pp136-141.
12. W. B. Langdon. Quadratic bloat in genetic programming. In D. Whitley, et al., eds., GECCO 2000, pp451-458.
13. W. B. Langdon and R. Poli. On Turing complete T7 and MISC F-4 program fitness landscapes. Technical Report CSM-445, University of Essex, UK, 2005.
14. S. R. Maxwell III. Experiments with a coroutine model for genetic programming. In 1994 IEEE World Congress on Computational Intelligence, pp413-417a.
15. G. J. Chaitin. An algebraic equation for the halting probability. In R. Herken, ed., The Universal Turing Machine A Half-Century Survey, pp279-283. OUP, 1988.
16. C. S. Calude, M. J. Dinneen and C-K Shu. Computing a glimpse of randomness. Experimental Mathematics, 11(3):361-370, 2002.