**Abstract** |

This is a contribution to constructive interpretation of classical logical proofs, that we see as learning strategies. We report on results about the limits of an abstract representation of learning processes, we call learning sequence, coming from Coquand's game theoretic interpretation of classical logic. Inspired to Gold's notion of limiting recursion and to the recent proposal of Limit-Computable Mathematics by Hayashi, we investigate the idea of learning in the limit in the general case, where both guess retraction and resumption are allowed. |

```
@techreport{BdL07,
number = {},
url = {http://www.di.unito.it/~deligu/papers/BdL07.pdf},
abstract = {This is a contribution to constructive interpretation of classical
logical proofs, that we see as learning strategies. We report on
results about the limits of an abstract representation of learning
processes, we call learning sequence, coming from Coquand's game
theoretic interpretation of classical logic. Inspired to Gold's
notion of limiting recursion and to the recent proposal of
Limit-Computable Mathematics by Hayashi, we investigate the idea
of learning in the limit in the general case, where both guess
retraction and resumption are allowed.},
title = {{Limit of learning sequences with retractable guesses}},
author = {Stefano Berardi and Ugo de' Liguoro},
year = {2007},
institution = {Universit\'a di Torino},
}
```

This document was generated by bib2html 3.3.

(Modified by Luca Paolini, under the GNU General Public License)