Home » forums » Programmer Forum

Turing completeness

Submitted by Provosti on Thu, 2008-10-02 03:33.

I remember, at some point, reading a sentence or two about possible Turing completeness implementation for the ES. So, the code producing the fractals could be used as a general self-evolving program. Is there any background on this, or was that only a vague idea?

‹ PyFLAM3 released Internet Connection - WHY? ›
» login or register to post comments

i think what you mean is

Submitted by spot on Thu, 2008-10-02 16:53.

i think what you mean is extending the visual language to be turing complete. in practical terms, one could do that by opening up the variations from a fixed set to algebraic expressions, and including genetic programming in the genetic algorithm. i don't really know what you mean by "self-evolving", but it would make for a greater variety of imagery and motion. the problem is that it's really hard to do that in an efficient and portable way, so it's not really on the agenda.

» login or register to post comments

My interest is not actually

Submitted by Provosti on Sat, 2008-10-04 12:33.

My interest is not actually the visuals, which would be only a nice by-product then. Rather, it's more related to AI and genetic algorithms in general. If the code producing the visuals would be "a general programming language" capable of forming "real" programs of any kind, mutating in the same way as the sheeps do, eventually we could see distributed agent programs constantly changing themselves in unforeseen ways. Of course, the program fitness function should be somewhat related to the visuals and their quality, but I'm not really sure how.

It would be great to hear some more opinions and discussion in this subject.

» login or register to post comments