#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1997

1998

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sylvain Porrot, Max Dauchet, Bruno Durand, Nikolai K. Vereshchagin
- FoSSaCS
- 1998

- Bruno Durand, Sylvain Porrot
- MFCS
- 1998

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)

- Sylvain Porrot, Max Dauchet, Denis Pomorski
- Bulletin of the EATCS
- 1997

- ‹
- 1
- ›