JUCS - Journal of Universal Computer Science 2(5): 439-441, doi: 10.3217/jucs-002-05-0439
Algorithmic Information Theory: Open Problems
expand article infoCristian S. S. Calude‡
‡ University of Auckland, Auckland, New Zealand

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

© Cristian S. Calude.
This article is freely available under the J.UCS Open Content License.
Citation: Calude CSS (1996) Algorithmic Information Theory: Open Problems. JUCS - Journal of Universal Computer Science 2(5): 439-441. https://doi.org/10.3217/jucs-002-05-0439
Open Access
Abstract
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.