| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Busy beaver function. | David A. Madore | 2023-10-19 | 1 | -0/+95 | |
| | | ||||||
| * | Decidable and semi-decidable sets. | David A. Madore | 2023-10-19 | 1 | -1/+233 | |
| | | ||||||
| * | Terminological cleanup. | David A. Madore | 2023-10-19 | 1 | -26/+212 | |
| | | ||||||
| * | Slightly more about Turing machines. | David A. Madore | 2023-10-18 | 1 | -0/+107 | |
| | | ||||||
| * | Turing machines and their equivalence with recursive functions. | David A. Madore | 2023-10-18 | 1 | -5/+261 | |
| | | ||||||
| * | The recursion theorem for general recursive functions, and the Halting problem. | David A. Madore | 2023-10-18 | 1 | -9/+322 | |
| | | ||||||
| * | General recursive functions: numbering, computation trees, universality, ↵ | David A. Madore | 2023-10-18 | 1 | -2/+238 | |
| | | | | | normal form. | |||||
| * | Remove flawed part about eliminating recursivity. | David A. Madore | 2023-10-18 | 1 | -105/+0 | |
| | | ||||||
| * | General recursive function: introduction. | David A. Madore | 2023-10-18 | 1 | -4/+231 | |
| | | | | | NB: The part about elimination of recursivity is flawed. Will remove | |||||
| * | More about primitive recursive functions, and Kleene's recursion theorem. | David A. Madore | 2023-10-17 | 1 | -12/+265 | |
| | | ||||||
| * | Tiding of things to come. | David A. Madore | 2023-10-17 | 1 | -0/+43 | |
| | | ||||||
| * | Primitive recursive functions. | David A. Madore | 2023-10-16 | 1 | -0/+197 | |
| | | ||||||
| * | More slides on intro to computability. | David A. Madore | 2023-10-12 | 1 | -0/+147 | |
| | | ||||||
| * | Initial commit with a basic set of slides. | David A. Madore | 2023-10-12 | 2 | -0/+222 | |
 |
index : teach/inf110-lfi.git | |
| INF110 (logique et fondements de l'informatique) | git repository hosting |
| summaryrefslogtreecommitdiffstats |