27 ottobre - 2 novembre
Schema della sezione
-
-
-
- Unbounded minimalisation [§2.5]
- Computability of the inverse function. Finite functions and their computability.
- Partial recursive functions [§3.1, §3.2, §3.7]
- Definition
- The class of partial recursive functions coincide with the class of URM-computable functions [statement and some ideas]
-
-
-
- Proof of the fact that the class of partial recursive functions coincide with the class of URM-computable functions
- Primitive recursive funcions. [§3.3]
- Ackermann's functions: total, computable and not primitive recursive [partially in §2.5.5]
-
-