Sylvain Porrot

  • Citations Per Year
Learn More
This paper investigates in terms of Kolmogorov complexity the diierences between the information necessary to compute a recursive function and the information contained in its graph. Our rst result is that the complexity of the initial parts of the graph of a recursive function, although bounded, has almost never a limit. The second result is that the(More)
  • 1