Archive for December, 2008

The Shortest Universal Turing Machine Implementation Contest

Posted in Algorithmic information theory, Complexity, Computability, Universality and Unsolvability, Foundations of Computation, New Ideas, Recreation on December 22nd, 2008 by Hector Zenil – Be the first to comment

The Shortest Universal Turing Machine Implementation Contest

ANNOUNCEMENT

23 Dec – 2008

http://www.mathrix.org/experimentalAIT/TuringMachine.html

Contest Overview

In the spirit of the busy beaver competition though related to program-size complexity, we are pleased to announce the “Shortest Universal Turing Machine Implementation Contest”.

The contest is open-ended and open to anyone. To enter, a competitor must submit a universal machine implementation written in the language specified in the contest web site (C++) with smaller size values than the latest  record published on the web page.

In order to take part in this competition it is necessary to submit the source code, to be compiled using the compiler program and version specified in the contest web site. It is important that you provide documentation of your code, either in an attached file or as commented text in the source code file.

Each submitter must agree to be bound and abide by the rules. Submissions remain the sole property of the submitter(s), but should be released under the GNU General Public License (GPL)  so we may be permitted to make them available on  this web site for downloading and executing.

Rules

http://www.mathrix.org/experimentalAIT/TuringMachine.html (General Rules section)

Team composition

Players may enter alone or as teams of any size. Anyone is eligible to enter.

Subscribe to the Newsletter

A mailing list will be used to keep participants informed of news about the contest. You can subscribe to this mailing list at any time:

Subscribe at here.
Organizers

Hector Zenil (IHPST and LIFL, Paris 1 University and Lille 1 University)
Jean-Paul Delahaye (LIFL, Lille 1 University)