teach/inf110-lfi.git - INF110 (logique et fondements de l'informatique)

	Commit message (Collapse)	Author	Age	Files	Lines
*	Switch to Latin Modern font (and fudge some line breaks).	David A. Madore	2023-11-03	1	-3/+4
\|
*	Reformulate formalizations of Turing reduction.	David A. Madore	2023-11-03	1	-21/+23
\| \| \| \|	(Still not happy about this.)
*	Typo.	David A. Madore	2023-11-02	1	-1/+1
\| \| \| \|	(Thanks, "jeanas".)
*	One formalization of Turing reduction was wrong: quick fix (to be improved!).	David A. Madore	2023-11-02	1	-5/+5
\|
*	A few things about Turing reduction.	David A. Madore	2023-11-02	1	-3/+128
\|
*	Many-to-one reduction, and a new proof of Rice's theorem.	David A. Madore	2023-11-02	1	-1/+160
\|
*	Rice's theorem.	David A. Madore	2023-11-02	1	-0/+88
\| \| \| \|	Thanks, "jeanas" for the reminder that this is important.
*	Numbering of recursive functions (compute explicit code for sum function).	David A. Madore	2023-11-01	1	-4/+14
\|
*	Minor changes.	David A. Madore	2023-11-01	1	-4/+4
\|
*	Googological meditation.	David A. Madore	2023-11-01	1	-5/+39
\|
*	Untyped lambda-calculus and a recursive type.	David A. Madore	2023-11-01	1	-0/+36
\|
*	Typo.	David A. Madore	2023-11-01	1	-1/+1
\| \| \| \|	(Thanks, Fabrice!)
*	Various minor corrections and clarifications.	David A. Madore	2023-10-30	1	-9/+13
\|
*	Some comments and final thoughts.	David A. Madore	2023-10-30	1	-11/+109
\|
*	Equivalence of functions representable in the lambda-calculus and recursive ↵	David A. Madore	2023-10-30	1	-4/+205
\| \| \| \|	functions.
*	Representation of p.r. functions by terms of the lambda-calculus.	David A. Madore	2023-10-30	1	-12/+138
\|
*	Representation of functions by terms of the lambda-calculus.	David A. Madore	2023-10-30	1	-2/+38
\|
*	A remark on arity.	David A. Madore	2023-10-30	1	-0/+53
\|
*	Outermost-leftmost (normal order) reduction; Church numerals.	David A. Madore	2023-10-25	1	-2/+99
\|
*	More about beta-reduction.	David A. Madore	2023-10-20	1	-16/+119
\|
*	Lambda-calculus: terms and bound variables.	David A. Madore	2023-10-20	1	-1/+112
\|
*	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