next up previous
Next: A PERCEPTRON FOR COUNTING Up: APPLICATION: FINDING ``SIMPLE'' NEURAL Previous: PREVIOUS ALGORITHMS FOR MAKING

GENERALIZATION TASKS: SIMULATIONS

In the experiments, the following values were used for maximal program tape size and work tape size: $s_p = 100$, $s_w = 1000$. The current implementation (which is not optimized for speed) tests about 3,000 programs per second on a SUN SPARC ELC. On average, a program runs for not many more than 10 time steps before halting or being halted. But there are programs running for millions of time steps, of course.



Juergen Schmidhuber 2003-02-12


Back to Optimal Universal Search page
Back to Program Evolution page
Back to Algorithmic Information page
Back to Speed Prior page