Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 2 / Issue 5

available in:   HTML (7 kB) PDF (101 kB) PS (32 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-002-05-0439

 

Algorithmic Information Theory: Open Problems

Cristian S. Calude (Computer Science Department, The University of Auckland, New Zealand)

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.