My paper On the Kolmogorov-Chaitin complexity for short sequences, coauthored with my PhD thesis advisor Jean-Paul Delahaye has been published as a book chapter in:RANDOMNESS AND COMPLEXITY, FROM LEIBNIZ TO CHAITIN, edited by Cristian S. Calude (University of Auckland, New Zealand) and published by World Scientific.
An extended draft version of this paper can be found in arXiv
here and the webpage we have set up for our research on what we call Experimental Algorithmic Theory can be accessed
here. The results of our ongoing experiments will be frequently published on this site.The book is a collection of papers contributed by eminent authors from around the world in honor of Gregory Chaitin’s birthday. It is a unique volume including technical contributions, philosophical papers and essays.
I presented our paper at the NKS Science Conference 2007 held at the University of Vermont, Burlington, U.S. The conference blog has an entry describing my participation.
From left to right: Hector Zenil, Stephen Wolfram, Paul Davies, Ugo Pagallo, Gregory Chaitin, Cristian Calude, Karl Svozil, Gordana Dodig-Crnkovic and John Casti.
Tags: algorithmic complexity, Cristian Calude, Jean-Paul Delahaye, John Casti, Paul Davies, randomness, Stephen Wolfram
This entry was posted
on Wednesday, October 31st, 2007 at 12:44 am and is filed under Algorithmic information theory, Computer Science, Foundations of Computation, New Ideas.
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.