| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Exercise on looping Turing machines. | David A. Madore | 2023-11-21 | 1 | -0/+71 |
| | | |||||
| * | Exercise showing that the indices of total functions is not semi-decidable ↵ | David A. Madore | 2023-11-21 | 1 | -0/+140 |
| | | | | | nor co-semi-decidable. | ||||
| * | The graph of the Ackermann function is p.r. | David A. Madore | 2023-11-20 | 1 | -0/+235 |
| | | |||||
| * | More exercises on computability. | David A. Madore | 2023-11-19 | 1 | -13/+250 |
| | | |||||
| * | Some exercises on computability. | David A. Madore | 2023-11-17 | 1 | -0/+350 |
 |
index : teach/inf110-lfi.git | |
| INF110 (logique et fondements de l'informatique) | git repository hosting |
| summaryrefslogtreecommitdiffstats |
path: root/exercices-inf110.tex