109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-002-05-0439 27253 Research Article Algorithmic Information Theory: Open Problems Calude Cristian S. S. cristian@cs.auckland.ac.nz https://orcid.org/0000-0002-8711-6799 1 University of Auckland, Auckland, New Zealand University of Auckland Auckland New Zealand

Corresponding author: Cristian S. S. Calude (cristian@cs.auckland.ac.nz).

Academic editor:

1996 28 05 1996 2 5 439 441 39A486E5-36A8-5DEC-A213-4DB70FB5D2DD 6995238 Cristian S. S. Calude This article is freely available under the J.UCS Open Content License.

This note collects some open problems in AIT which have been discussed during the Summer School "Chaitin Complexity and Applications. Each problem comes with the name(s) of the person(s) who suggested it, and more details about the listed open problems can be found directly by contacting the correspondent author: G. J. Chaitin (email: chaitin@watson.ibm.com), F. Geurts (email: gf@info.ucl.ac.be), H. Juergensen (email: helmut@uwo.ca), T. Odor (email: odor@math-inst.hu), K. Svozil (email: svozil@tph.tuwien.ac.at). This list will be periodically up-to-dated in the home-page of the CDMTCS at url http://www.cs.auckland.ac.nz/CDMTCS/researchreports/ait.openproblems.ps.gz 1.) C. Calude (ed.). The Finite, the Unbounded and the Infinite, Proceedings of the Summer School ``Chaitin Complexity and Applications'', Mangalia, Romania, 27 June -- 6 July, 1995.