See this document in CiteSeerX!

Turing Completeness in the Language of Genetic Programming with Indexed Memory (1994)  (Make Corrections)  (16 citations)
Astro Teller
Proceedings of the 1994 IEEE World Congress on Computational Intelligence



  Home/Search   Context   Related

 
View or download:
cmu.edu/afs/cs/usr/astro/pu...Turing.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/~astro/...aperpageframe (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: : Genetic Programming is a method for evolving functions that find approximate or exact solutions to problems. There are many problems that traditional Genetic Programming (GP) cannot solve, due to the theoretical limitations of its paradigm. A Turing machine (TM) is a theoretical abstraction that express the extent of the computational power of algorithms. Any system that is Turing complete is sufficiently powerful to recognize all possible algorithms. GP is not Turing complete. This paper... (Update)

Cited by:   More
Genetic Programming Techniques for Sensor Networks Thomas.. - University Of Kassel (2006)   (Correct)
Efficient Markov chain model of machine code program execution .. - Poli, Langdon (2006)   (Correct)
Reinforcement Learning for Problems with Hidden State - Hasinoff (2003)   (Correct)

Similar documents (at the sentence level):
12.2%:   Genetic Programming, Indexed Memory, The Halting Problem.. - Astro Teller Carnegie   (Correct)

Active bibliography (related documents):   More   All
0.0:   A Controlled Experiment: Evolution for Learning Difficult.. - Teller, Veloso   (Correct)
0.0:   Learning to Predict through Probabilistic Incremental.. - Salustowicz, Schmidhuber (1998)   (Correct)
0.0:   Genetically Programming Networks to Evolve Memory Mechanisms - Silva, Neves, Costa (1999)   (Correct)

Similar documents based on text:   More   All
0.0:   Random-Cluster Representation of the Ashkin-Teller Model - Pfister, Velenik (1997)   (Correct)
0.0:   Percolation And Gibbs States Multiplicity For.. - Chayes, McKellar, Winn (1998)   (Correct)
0.0:   Electron Correlation and Jahn-Teller Interaction in Manganese .. - Nagaosa, Murakami   (Correct)

Related documents from co-citation:   More   All
8:   The evolution of mental models (context) - Teller - 1994
7:   Genetic Programming - John - 1992
7:   Advances in Genetic Programming (context) - Jr - 1992

BibTeX entry:   (Update)

Astro Teller. Turing completeness in the language of genetic programming with indexed memory. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1. IEEE Press, Jun 1994. http://citeseer.ist.psu.edu/teller94turing.html   More

@inproceedings{ teller94turing,
    author = "Astro Teller",
    title = "Turing Completeness in the Language of Genetic Programming with Indexed Memory",
    booktitle = "Proceedings of the 1994 {IEEE} World Congress on Computational Intelligence",
    volume = "1",
    month = "27-29",
    publisher = "IEEE Press",
    address = "Orlando, Florida, USA",
    pages = "136--141",
    year = "1994",
    url = "citeseer.ist.psu.edu/teller94turing.html" }
Citations (may not include all citations):
72   The Evolution of Mental Models (context) - Astro - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.cmu.edu/~astro/astro-paper-page-frame.html):   More
Learning Mental Models - Astro Teller Department (1993)   (Correct)
Genetic Programming, Indexed Memory, The Halting Problem.. - Astro Teller Carnegie   (Correct)
Neural Programming and an Internal Reinforcement Policy - Teller, Veloso (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC